TGFormer: Towards Temporal Graph Transformer with Auto-Correlation Mechanism

• URL: http://arxiv.org/abs/2605.24971v1
• Date: Sun, 24 May 2026 09:53:25 GMT
• Title: TGFormer: Towards Temporal Graph Transformer with Auto-Correlation Mechanism
• Abstract summary: TGFormer is a novel Transformer architecture specifically designed for temporal graphs.<n>Our model redefines temporal graph learning by establishing a trajectory framework that aligns with time series analysis principles.<n>Building upon process theory, we develop an auto-correlation mechanism that uncovers periodic dependencies in node interactions.
• Score: 21.417433784980215
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The growing interest in Temporal Graph Neural Networks (TGNNs) stems from their ability to model complex dynamics and deliver superior performance. However, TGNNs encounter fundamental challenges in capturing long-term dependencies and identifying periodic patterns. To address these limitations, we propose TGFormer, a novel Transformer architecture specifically designed for temporal graphs. Our model redefines temporal graph learning by establishing a trajectory framework that aligns with time series analysis principles. This approach allows TGFormer to derive node representations through systematic analysis of historical interactions, enabling granular examination of node relationships across sequential timestamps. Building upon stochastic process theory, we develop an auto-correlation mechanism that systematically uncovers periodic dependencies in node interactions. This innovation empowers TGFormer to perform dependency discovery and representation aggregation at sub-interaction levels, demonstrating superior efficiency and accuracy compared to conventional attention mechanisms. Experimental validation across six public benchmarks confirms the effectiveness of our approach, with TGFormer at most achieving 9.35\% precision improvement compared to state-of-the-art approaches.

Related papers

• Temporal Memory-Aware Online Test-Time Adaptation on Dynamic Graphs [52.31268996286955]
  Test-time adaptation (TTA) on graphs aims to adapt a graph neural network (GNN) that is well-trained on the training graph to the test graph.<n>We propose a novel framework of temporal memory-aware Online Test-Time Adaptation on Dynamic Graphs, named DGOTTA, to effectively adapt well-trained DGNNs during test time.
  arXiv  Detail & Related papers  (2026-08-28T05:41:39Z)
• Timestamp-Aware Spatio-Temporal Graph Contrastive Learning for Network Intrusion Detection [12.117106433382437]
  We propose a novel self-supervised graph neural network (GNN)-based framework for intrusion detection systems.<n>The proposed model explicitly leverage real timestamps, which provides faithful temporal dependencies for representation learning.<n>We show that our method significantly outperforms existing self-supervised approaches and achieves performance comparable to the supervised state-of-the-art GNN method.
  arXiv  Detail & Related papers  (2026-06-15T04:45:41Z)
• Gaussian Relational Graph Transformer [14.982543038240784]
  GelGT is a relational graph transformer with a structure-semantic collaborative sampling strategy.<n>Experiments on various real-world datasets demonstrate that GelGT achieves state-of-theart downstream task performance.
  arXiv  Detail & Related papers  (2026-05-15T03:36:28Z)
• Evolutionary Router Feature Generation for Zero-Shot Graph Anomaly Detection with Mixture-of-Experts [60.60414602796664]
  We propose a novel MoE framework with evolutionary router feature generation (EvoFG) for zero-shot GAD.<n>EvoFG consistently outperforms state-of-the-art baselines, achieving strong and stable zero-shot GAD performance.
  arXiv  Detail & Related papers  (2026-02-12T06:16:51Z)
• Temporal Graph Pattern Machine [17.352525018007473]
  Temporal Graph Pattern Machine (TGPM) conceptualizes each interaction as an interaction patch synthesized via temporally-biased random walks.<n>TGPM consistently achieves state-of-the-art performance in both transductive and inductive link prediction.
  arXiv  Detail & Related papers  (2026-01-30T01:46:13Z)
• Simple and Efficient Heterogeneous Temporal Graph Neural Network [6.370086864615097]
  Heterogeneous temporalous graphs (HTGs) are ubiquitous data structures in the real world.<n>We propose a novel learning paradigm for HTGs called Simple and Efficient Heterogeneous Temporal Graph Neural Network (SE-HTGNN)
  arXiv  Detail & Related papers  (2025-10-21T09:43:08Z)
• When Speed meets Accuracy: an Efficient and Effective Graph Model for Temporal Link Prediction [20.093092172339286]
  Temporal Graph Neural Networks (T-GNNs) have achieved notable success by leveraging complex architectures to model temporal and structural dependencies.<n>We propose a lightweight framework that integrates short-term temporal recency and long-term global structural patterns.
  arXiv  Detail & Related papers  (2025-07-18T11:29:15Z)
• Mind the truncation gap: challenges of learning on dynamic graphs with recurrent architectures [10.434476078553786]
  Continuous-time dynamic graphs (CTDGs) pose challenges for machine learning (ML) approaches.<n>We show that a short truncation of backpropagation-through-time (BPTT) can limit the learning of dependencies beyond a single hop.<n>We argue that understanding and addressing this gap is essential as the importance of CTDGs grows.
  arXiv  Detail & Related papers  (2024-12-30T16:07:41Z)
• Detecting Anomalies in Dynamic Graphs via Memory enhanced Normality [39.476378833827184]
  Anomaly detection in dynamic graphs presents a significant challenge due to the temporal evolution of graph structures and attributes. We introduce a novel spatial- temporal memories-enhanced graph autoencoder (STRIPE) STRIPE significantly outperforms existing methods with 5.8% improvement in AUC scores and 4.62X faster in training time.
  arXiv  Detail & Related papers  (2024-03-14T02:26:10Z)
• TimeGraphs: Graph-based Temporal Reasoning [64.18083371645956]
  TimeGraphs is a novel approach that characterizes dynamic interactions as a hierarchical temporal graph. Our approach models the interactions using a compact graph-based representation, enabling adaptive reasoning across diverse time scales. We evaluate TimeGraphs on multiple datasets with complex, dynamic agent interactions, including a football simulator, the Resistance game, and the MOMA human activity dataset.
  arXiv  Detail & Related papers  (2024-01-06T06:26:49Z)
• EasyDGL: Encode, Train and Interpret for Continuous-time Dynamic Graph Learning [92.71579608528907]
  This paper aims to design an easy-to-use pipeline (termed as EasyDGL) composed of three key modules with both strong ability fitting and interpretability. EasyDGL can effectively quantify the predictive power of frequency content that a model learn from the evolving graph data.
  arXiv  Detail & Related papers  (2023-03-22T06:35:08Z)
• Space-Time Graph Neural Networks with Stochastic Graph Perturbations [100.31591011966603]
  Space-time graph neural networks (ST-GNNs) learn efficient graph representations of time-varying data. In this paper we revisit the properties of ST-GNNs and prove that they are stable to graph stabilitys. Our analysis suggests that ST-GNNs are suitable for transfer learning on time-varying graphs.
  arXiv  Detail & Related papers  (2022-10-28T16:59:51Z)
• Spatio-Temporal Joint Graph Convolutional Networks for Traffic Forecasting [75.10017445699532]
  Recent have shifted their focus towards formulating traffic forecasting as atemporal graph modeling problem. We propose a novel approach for accurate traffic forecasting on road networks over multiple future time steps.
  arXiv  Detail & Related papers  (2021-11-25T08:45:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.