LGJan 19

Deep Temporal Graph Clustering: A Comprehensive Benchmark and Datasets

arXiv:2601.12903v119 citationsHas CodeIEEE Trans Pattern Anal Mach Intell
Originality Synthesis-oriented
AI Analysis

This work addresses the problem of node clustering in temporal graphs for researchers, but it is incremental as it focuses on benchmarking and dataset development rather than a new method.

The paper tackles the lack of attention to Temporal Graph Clustering (TGC) by proposing BenchTGC, a comprehensive benchmark and datasets, which verifies the advantages of TGC and demonstrates its necessity and importance through extensive experiments.

Temporal Graph Clustering (TGC) is a new task with little attention, focusing on node clustering in temporal graphs. Compared with existing static graph clustering, it can find the balance between time requirement and space requirement (Time-Space Balance) through the interaction sequence-based batch-processing pattern. However, there are two major challenges that hinder the development of TGC, i.e., inapplicable clustering techniques and inapplicable datasets. To address these challenges, we propose a comprehensive benchmark, called BenchTGC. Specially, we design a BenchTGC Framework to illustrate the paradigm of temporal graph clustering and improve existing clustering techniques to fit temporal graphs. In addition, we also discuss problems with public temporal graph datasets and develop multiple datasets suitable for TGC task, called BenchTGC Datasets. According to extensive experiments, we not only verify the advantages of BenchTGC, but also demonstrate the necessity and importance of TGC task. We wish to point out that the dynamically changing and complex scenarios in real world are the foundation of temporal graph clustering. The code and data is available at: https://github.com/MGitHubL/BenchTGC.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes