English

TGTOD: A Global Temporal Graph Transformer for Outlier Detection at Scale

Machine Learning 2024-12-03 v1 Social and Information Networks

Abstract

While Transformers have revolutionized machine learning on various data, existing Transformers for temporal graphs face limitations in (1) restricted receptive fields, (2) overhead of subgraph extraction, and (3) suboptimal generalization capability beyond link prediction. In this paper, we rethink temporal graph Transformers and propose TGTOD, a novel end-to-end Temporal Graph Transformer for Outlier Detection. TGTOD employs global attention to model both structural and temporal dependencies within temporal graphs. To tackle scalability, our approach divides large temporal graphs into spatiotemporal patches, which are then processed by a hierarchical Transformer architecture comprising Patch Transformer, Cluster Transformer, and Temporal Transformer. We evaluate TGTOD on three public datasets under two settings, comparing with a wide range of baselines. Our experimental results demonstrate the effectiveness of TGTOD, achieving AP improvement of 61% on Elliptic. Furthermore, our efficiency evaluation shows that TGTOD reduces training time by 44x compared to existing Transformers for temporal graphs. To foster reproducibility, we make our implementation publicly available at https://github.com/kayzliu/tgtod.

Keywords

Cite

@article{arxiv.2412.00984,
  title  = {TGTOD: A Global Temporal Graph Transformer for Outlier Detection at Scale},
  author = {Kay Liu and Jiahao Ding and MohamadAli Torkamani and Philip S. Yu},
  journal= {arXiv preprint arXiv:2412.00984},
  year   = {2024}
}

Comments

Preprint. Under review. Code available at https://github.com/kayzliu/tgtod

R2 v1 2026-06-28T20:18:52.423Z