EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura, Hiroki Kanezashi, Tim Kaler, Tao B. Schardl, Charles E. Leiserson
Abstract
Graph representation learning resurges as a trending research subject owing to the widespread use of deep learning for Euclidean data, which inspire various creative designs of neural networks in the non-Euclidean domain, particularly graphs. With the success of these graph neural networks (GNN) in the static setting, we approach further practical scenarios where the graph dynamically evolves. Existing approaches typically resort to node embeddings and use a recurrent neural network (RNN, broadly speaking) to regulate the embeddings and learn the temporal dynamics. These methods require the knowledge of a node in the full time span (including both training and testing) and are less applicable to the frequent change of the node set. In some extreme scenarios, the node sets at different time steps may completely differ. To resolve this challenge, we propose EvolveGCN, which adapts the graph convolutional network (GCN) model along the temporal dimension without resorting to node embeddings. The proposed approach captures the dynamism of the graph sequence through using an RNN to evolve the GCN parameters. Two architectures are considered for the parameter evolution. We evaluate the proposed approach on tasks including link prediction, edge classification, and node classification. The experimental results indicate a generally higher performance of EvolveGCN compared with related approaches. The code is available at https://github.com/IBM/EvolveGCN .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext b564bd0e-9c75-418a-bc36-d715661262dcCited by top-tier papers171
- Measuring and Relieving the Over-Smoothing Problem for Graph Neural Networks from the Topological ViewDeli Chen, Yankai Lin, Wei Li, Peng Li et al.AAAI 2020 · 1,353 citations
- Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge GraphsWoojeong Jin, Meng Qu, Xisen Jin, Xiang RenEMNLP 2020 · 353 citations
- Inductive Representation Learning in Temporal Networks via Causal Anonymous WalksYanbang Wang, Yen-Yu Chang, Yunyu Liu, Jure Leskovec et al.ICLR 2021 · 326 citations
- Towards Better Dynamic Graph Learning: New Architecture and Unified LibraryLe Yu, Leilei Sun, Bowen Du, Weifeng LvNeurIPS 2023 · 323 citations
- Handling Distribution Shifts on Graphs: An Invariance PerspectiveQitian Wu, Hengrui Zhang, Junchi Yan, David WipfICLR 2022 · 261 citations
Related papers
- TP-GNN: Continuous Dynamic Graph Neural Network for Graph ClassificationJie Liu, Jiamou Liu, Kaiqi Zhao, Yanni Tang et al.ICDE 2024 · 9 citations
- Temporal Knowledge Graph Reasoning Based on Evolutional Representation LearningZixuan Li, Xiaolong Jin, Wei Li, Saiping Guan et al.SIGIR 2021 · 345 citations
- Streaming Graph Neural NetworksYao Ma, Ziyi Guo, Zhaochun Ren, Jiliang Tang et al.SIGIR 2020 · 210 citations
- On the Equivalence Between Temporal and Static Equivariant Graph RepresentationsJianfei Gao, Bruno RibeiroICML 2022 · 84 citations
- Node-Time Conditional Prompt Learning in Dynamic GraphsXingtong Yu, Zhenghao Liu, Xinming Zhang, Yuan FangICLR 2025
