CLGNN: A Contrastive Learning-based GNN Model for Betweenness Centrality Prediction on Temporal Graphs
Not on the map. Why?
Abstract (arXiv)
Temporal Betweenness Centrality (TBC) measures how often a node appears on optimal temporal paths, reflecting its importance in temporal networks. However, exact computation is highly expensive, and real-world TBC distributions are extremely imbalanced. The severe imbalance leads learning-based models to overfit to zero-centrality nodes, resulting in inaccurate TBC predictions and failure to identify truly central nodes. Existing graph neural network (GNN) methods either fail to handle such imbalance or ignore temporal dependencies altogether. To address these issues, we propose a scalable and inductive contrastive learning-based GNN (CLGNN) for accurate and efficient TBC prediction. CLGNN builds an instance graph to preserve path validity and temporal order, then encodes structural and temporal features using dual aggregation, i.e., mean and edge-to-node multi-head attention mechanisms, enhanced by temporal path count and time encodings. A stability-based clustering-guided contrastive module (KContrastNet) is introduced to separate high-, median-, and low-centrality nodes in representation space, mitigating class imbalance, while a regression module (ValueNet) estimates TBC values. CLGNN also supports multiple optimal path definitions to accommodate diverse temporal semantics. Extensive experiments demonstrate the effectiveness and efficiency of CLGNN across diverse benchmarks. CLGNN achieves up to a 663.7~× speedup compared to state-of-the-art exact TBC computation methods. It outperforms leading static GNN baselines with up to 31.4~× lower MAE and 16.7~× higher Spearman correlation, and surpasses state-of-the-art temporal GNNs with up to 5.7~× lower MAE and 3.9~× higher Spearman correlation.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 26 of its 55 references that are in the map. First posted on arXiv 17 Jun 2025.
Builds on
26 of 55 references.
References · 26
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2021How Attentive are Graph Attention Networks?cited by 835
- 2019A Theoretical Analysis of Contrastive Unsupervised Representation Learningcited by 530
- 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 530
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 447
- 2021Delving into Deep Imbalanced Regressioncited by 158
- 2015Contact patterns in a high school: a comparison between data collected using wearable sensors, contact diaries and friendship surveyscited by 60
- 2014Contact patterns among high school studentscited by 18
- 2019Learning to Identify High Betweenness Centrality Nodes from Scratch: A Novel Graph Neural Network Approachcited by 16
14 more
- 2017Can co-location be used as a proxy for face-to-face contacts?cited by 13
- 2022De Bruijn goes Neural: Causality-Aware Graph Neural Networks for Time Series Data on Dynamic Graphscited by 10
- 2016KADABRA is an ADaptive Algorithm for Betweenness via Random Approximationcited by 7
- 2020Approximating Network Centrality Measures Using Node Embedding and Machine Learningcited by 6
- 2016ABRA: Approximating Betweenness Centrality in Static and Dynamic Graphs with Rademacher Averagescited by 5
- 2023Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphscited by 5
- 2024Label Informed Contrastive Pretraining for Node Importance Estimation on Knowledge Graphscited by 5
- 2020Algorithmic Aspects of Temporal Betweennesscited by 3
- 2021SILVAN: Estimating Betweenness Centralities with Progressive Sampling and Non-uniform Rademacher Boundscited by 3
- 2022ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networkscited by 3
- 2021Efficient Top-k Ego-Betweenness Searchcited by 2
- 2024Node Centrality Approximation For Large Networks Based On Inductive Graph Neural Networkscited by 2
- 2014A Divide-and-Conquer Algorithm for Betweenness Centralitycited by 1
- 2017Identifying high betweenness centrality nodes in large social networkscited by 1
Built on by
Not cited yet.