Deep Temporal Graph Clustering
Abstract
Deep graph clustering has recently received significant attention due to its ability to enhance the representation learning capabilities of models in unsupervised scenarios. Nevertheless, deep clustering for temporal graphs, which could capture crucial dynamic interaction information, has not been fully explored. It means that in many clustering-oriented real-world scenarios, temporal graphs can only be processed as static graphs. This not only causes the loss of dynamic information but also triggers huge computational consumption. To solve the problem, we propose a general framework for deep Temporal Graph Clustering called TGC, which introduces deep clustering techniques to suit the interaction sequence-based batch-processing pattern of temporal graphs. In addition, we discuss differences between temporal graph clustering and static graph clustering from several levels. To verify the superiority of the proposed framework TGC, we conduct extensive experiments. The experimental results show that temporal graph clustering enables more flexibility in finding a balance between time and space requirements, and our framework can effectively improve the performance of existing temporal graph learning methods. The code is released:.
Benchmark Results
Tested on 1 dataset 3 baseline values reported too low Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterogeneous Graph Benchmarks
DBLP
Global leaderboard →Sorted by F1. Highlighted rows are from other papers.
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | AUG_bal | 0.9454
±0.0123 | |
| 2 | AUG_min | 0.9375
±0.0115 | |
| 3 | AUG_ran | 0.9368
±0.0108 | |
| 35 | GAE | 0.7680 best reported | best at pub: Unsupervised Network Embedding Beyond Homophily (TMLR 2022) |
| 36 | DFCN | 0.7570
±0.0080 best reported | |
| 37 | AE | 0.7460 best reported | best at pub: Unsupervised Network Embedding Beyond Homophily (TMLR 2022) |
| 39 | SAGE | 0.7320 | |
| 42 | SDCN | 0.6771
±0.0151 best reported | best at pub: Unsupervised Network Embedding Beyond Homophily (TMLR 2022) |
| 50 | MVGRL | 0.5500
±0.0700 best reported | best today: Non-Dissipative Graph Propagation for Non-Local Community Detection (2025) |
| 53 | TGC | 0.4503 | This paper |
| 55 | TREND | 0.4454 | This paper |
| 56 | HTNE | 0.4398 | This paper |
| 57 | Node2Vec | 0.4335 | This paper |
| 59 | DeepWalk | 0.3856 | This paper |
| 60 | SDCNQ | 0.3518 | This paper |
| 61 | TGAT | 0.3422 | This paper |
| 64 | JODIE | 0.1323 | This paper |
| 65 | TGN | 0.1066 | This paper |
