Learning Dynamic Graph Representations through Timespan View Contrasts
Not on the map. Why?
Abstract (arXiv)
The rich information underlying graphs has inspired further investigation of unsupervised graph representation. Existing studies mainly depend on node features and topological properties within static graphs to create self-supervised signals, neglecting the temporal components carried by real-world graph data, such as timestamps of edges. To overcome this limitation, this paper explores how to model temporal evolution on dynamic graphs elegantly. Specifically, we introduce a new inductive bias, namely temporal translation invariance, which illustrates the tendency of the identical node to keep similar labels across different timespans. Based on this assumption, we develop a dynamic graph representation framework CLDG that encourages the node to maintain locally consistent temporal translation invariance through contrastive learning on different timespans. Except for standard CLDG which only considers explicit topological links, our further proposed CLDG++ additionally employs graph diffusion to uncover global contextual correlations between nodes, and designs a multi-scale contrastive learning objective composed of local-local, local-global, and global-global contrasts to enhance representation capabilities. Interestingly, by measuring the consistency between different timespans to shape anomaly indicators, CLDG and CLDG++ are seamlessly integrated with the task of spotting anomalies on dynamic graphs, which has broad applications in many high-impact domains, such as finance, cybersecurity, and healthcare. Experiments demonstrate that CLDG and CLDG++ both exhibit desirable performance in downstream tasks including node classification and dynamic graph anomaly detection. Moreover, CLDG significantly reduces time and space complexity by implicitly exploiting temporal cues instead of complicated sequence models.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 11 of its 80 references that are in the map. First posted on arXiv 26 May 2026.
Builds on
11 of 80 references.
References · 11
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2014Learning Phrase Representations using RNN Encoder-Decoder for Statistical Machine Translationcited by 4,057
- 2021SimCSE: Simple Contrastive Learning of Sentence Embeddingscited by 2,173
- 2018Learning deep representations by mutual information estimation and maximizationcited by 1,273
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020Inductive Representation Learning on Temporal Graphscited by 462
- 2021Combinatorial optimization and reasoning with graph neural networkscited by 268
- 2021Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Predictioncited by 138
- 2018DynGEM: Deep Embedding Method for Dynamic Graphscited by 102
Built on by
Not cited yet.