paper-with-me

홈 › Papers

CLGNN: A Contrastive Learning-based GNN Model for Betweenness Centrality Prediction on Temporal Graphs

2025-06-17 · Tianming Zhang, Renbo Zhang, Zhengyi Yang, Yunjun Gao, Bin Cao, Jing Fan

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~$\times$ speedup compared to state-of-the-art exact TBC computation methods. It outperforms leading static GNN baselines with up to 31.4~$\times$ lower MAE and 16.7~$\times$ higher Spearman correlation, and surpasses state-of-the-art temporal GNNs with up to 5.7~$\times$ lower MAE and 3.9~$\times$ higher Spearman correlation.

📄 PDF Abstract BibTeX arXiv:2506.14122

Code (0)

등록된 구현이 없습니다.

Tasks

Contrastive LearningGraph Neural Network

Methods 이 논문이 사용한 방법론

MAE 설명 없음
Graph Neural Network 설명 없음

Similar Papers 제목 키워드 기반

ONBRA: Rigorous Estimation of the Temporal Betweenness Centrality in Temporal Networks

2022-03-01 · Diego Santoro, Ilie Sarpe

In network analysis, the betweenness centrality of a node informally captures the fraction of shortest paths visiting that node. The computation of the betweenness centrality measure is a fundamental task in the analysis…

Temporal Walk Centrality: Ranking Nodes in Evolving Networks

2022-02-08 · Lutz Oettershagen, Petra Mutzel, Nils M. Kriege

We propose the Temporal Walk Centrality, which quantifies the importance of a node by measuring its ability to obtain and distribute information in a temporal network. In contrast to the widely-used betweenness centralit…

Using Time-Aware Graph Neural Networks to Predict Temporal Centralities in Dynamic Graphs

2023-10-24 · Franziska Heeg, Ingo Scholtes

Node centralities play a pivotal role in network science, social network analysis, and recommender systems. In temporal data, static path-based centralities like closeness or betweenness can give misleading results about…

Graph LearningGraph Neural NetworkRecommendation SystemsTime Series

Graph Neural Networks for Scalable and Transferable Node Centrality Approximation

2026-07-10 · Samra Sana, Giorgio Mantica, Saul Imbrici arxiv

Graph Neural Networks (GNNs) provide a learning-based framework for approximating graph quantities that are expensive to compute exactly. This paper investigates GNNs for scalable approximation of betweenness and closene…

Computing Betweenness Centrality in Link Streams

2021-02-12 · Frédéric Simard, Clémence Magnien, Matthieu Latapy

Betweeness centrality is one of the most important concepts in graph analysis. It was recently extended to link streams, a graph generalization where links arrive over time. However, its computation raises non-trivial is…