The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
node2vec: Scalable Feature Learning for Networks
Grover, A., & Leskovec, J. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939754 · Cited by 10,926
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
DeepWalk: online learning of social representations
Perozzi, B., Al-Rfou, R., & Skiena, S. (2014) · Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2623330.2623732 · Cited by 10,123
Veličković, P., Casanova, A., Liò, P., Cucurull, G., Romero, A., & Bengio, Y. (2017) · arXiv (Cornell University) · doi:10.17863/cam.48429 · Cited by 8,657
LINE: Large-scale Information Network Embedding
Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., & Mei, Q. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741093 · Cited by 5,416
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
Cited by
Graph neural networks: A review of methods and applications
Zhou, J., Cui, G., Hu, S., Zhang, Z., Yang, C., Liu, Z., Wang, L., Li, C., & Sun, M. (2020) · AI Open · doi:10.1016/j.aiopen.2021.01.001 · Cited by 6,880
Chen, D., Lin, Y., Li, W., Li, P., Zhou, J., & Sun, X. (2020) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v34i04.5747 · Cited by 1,043
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multi-Modal
Liang, K., Meng, L., Liu, M., Liu, Y., Tu, W., Wang, S., Zhou, S., Liu, X., Sun, F., & He, K. (2024) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2024.3417451 · Cited by 553
Recurrent Event Network: Autoregressive Structure Inferenceover Temporal Knowledge Graphs
Jin, W., Qu, M., Jin, X., & Ren, X. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.541 · Cited by 409
Temporal Graph Networks for Deep Learning on Dynamic Graphs
Rossi, E., Chamberlain, B., Frasca, F., Eynard, D., Monti, F., & Bronstein, M. (2020) · arXiv · doi:10.48550/arxiv.2006.10637 · Cited by 382
Foundations and Modeling of Dynamic Networks Using Dynamic Graph Neural Networks: A Survey
Skarding, J., Gabrys, B., & Musial, K. (2021) · IEEE Access · doi:10.1109/access.2021.3082932 · Cited by 331
Graph representation learning in biomedicine and healthcare
Li, M. M., Huang, K., & Zitnik, M. (2022) · Nature Biomedical Engineering · doi:10.1038/s41551-022-00942-x · Cited by 294
Computing Graph Neural Networks: A Survey from Algorithms to Accelerators
Abadal, S., Jain, A., Guirado, R., López-Alonso, J., & Alarcón, E. (2022) · ACM Computing Surveys · doi:10.1145/3477141 · Cited by 285
Domain Adversarial Graph Convolutional Network for Fault Diagnosis Under Variable Working Conditions
Li, T., Zhao, Z., Sun, C., Yan, R., & Chen, X. (2021) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2021.3075016 · Cited by 280
TeMP: Temporal Message Passing for Temporal Knowledge Graph Completion
Wu, J., Cao, M., Cheung, J. C. K., & Hamilton, W. L. (2020) · Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2020.emnlp-main.462 · Cited by 167
Learning to Walk across Time for Interpretable Temporal Knowledge Graph Completion
Jung, J., Jung, J., & Kang, U. (2021) · Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining · doi:10.1145/3447548.3467292 · Cited by 82
Lifelong Property Price Prediction: A Case Study for the Toronto Real Estate Market
Peng, H., Li, J., Wang, Z., Yang, R., Liu, M., Zhang, M., Yu, P., & He, L. (2021) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2021.3112749 · Cited by 43
Reinforced Structured State-Evolution for Vision-Language Navigation
Chen, J., Gao, C., Meng, E., Zhang, Q., & Liu, S. (2022) · 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr52688.2022.01501 · Cited by 45
Self-citationPredicting Patient Outcomes with Graph Representation Learning
Tong, C., Rocheteau, E., Veličković, P., Lane, N., & Liò, P. (2022) · Studies in Computational Intelligence · doi:10.1007/978-3-030-93080-6_20 · Cited by 38
Temporal and Heterogeneous Graph Neural Network for Remaining Useful Life Prediction
Wen, Z., Fang, Y., Wei, P., Liu, F., Chen, Z., & Wu, M. (2025) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2025.3592788 · Cited by 34
Anonymous Edge Representation for Inductive Anomaly Detection in Dynamic Bipartite Graph
Fang, L., Feng, K., Gui, J., Feng, S., & Hu, A. (2023) · Proceedings of the VLDB Endowment · doi:10.14778/3579075.3579088 · Cited by 21
A Flexible Attentive Temporal Graph Networks for Anomaly Detection in Dynamic Networks
Zhu, D., Ma, Y., & Liu, Y. (2020) · 2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom50675.2020.00117 · Cited by 19
Timespan-Aware Dynamic Knowledge Graph Embedding by Incorporating Temporal Evolution
Tang, X., Yuan, R., Li, Q., Wang, T., Yang, H., Cai, Y., & Song, H. (2020) · IEEE Access · doi:10.1109/access.2020.2964028 · Cited by 19
Detecting malicious IoT network communication through Graph Neural Networks in real-world conditions
Carletti, V., Foggia, P., Rosa, F., & Vento, M. (2025) · Pattern Recognition Letters · doi:10.1016/j.patrec.2025.01.010 · Cited by 12
Temporal subgraph contrastive learning for anomaly detection on dynamic attributed graphs
Yu, Y., Li, X., Shao, M., Sun, Y., & Wang, W. (2025) · Applied Intelligence · doi:10.1007/s10489-025-06402-8 · Cited by 2
Temporal Graph Networks for Bank Customer Churn Prediction with Dynamic
Sun, P. (2025) · Proceedings of the 2nd International Conference on Data Science and Engineering · doi:10.5220/0013688900004670 · Cited by 1
Yang, S., & Liu, X. (2026) · Journal of King Saud University Computer and Information Sciences · doi:10.1007/s44443-026-00904-2
Metadata
- Authors
- Pareja, A., Domeniconi, G., Chen, J., Ma, T., Suzumura, T., Kanezashi, H., Kaler, T., Schardl, T., & Leiserson, C.
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2020-04-03
- Volume
- 34
- Issue
- 04
- Pages
- 5363-5370
- ISSN
- 2374-3468
- 2159-5399
- OpenAlex
- W2998313947
- Cited by
- 1,221
- References
- 26
- FWCI
- 51.90
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.