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
Spectral Networks and Locally Connected Networks on Graphs
Bruna, J., Zaremba, W., Szlam, A., & LeCun, Y. (2013) · arXiv · doi:10.48550/arxiv.1312.6203 · Cited by 3,983
Neural Message Passing for Quantum Chemistry
Gilmer, J., Schoenholz, S. S., Riley, P. F., Vinyals, O., & Dahl, G. E. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.01212 · Cited by 3,440
Asymmetric Transitivity Preserving Graph Embedding
Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939751 · Cited by 1,248
Structured Sequence Modeling with Graph Convolutional Recurrent Networks
Seo, Y., Defferrard, M., Vandergheynst, P., & Bresson, X. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-04167-0_33 · Cited by 843
Continuous-Time Dynamic Network Embeddings
Nguyen, G. H., Lee, J. B., Rossi, R. A., Ahmed, N. K., Koh, E., & Kim, S. (2018) · Companion of the The Web Conference 2018 on The Web Conference 2018 - WWW '18 · doi:10.1145/3184558.3191526 · Cited by 538
Dynamic Network Embedding by Modeling Triadic Closure Process
Zhou, L., Yang, Y., Ren, X., Wu, F., & Zhuang, Y. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11257 · Cited by 473
dyngraph2vec: Capturing network dynamics using dynamic graph representation learning
Goyal, P., Chhetri, S. R., & Canedo, A. (2020) · Knowledge-Based Systems · doi:10.1016/j.knosys.2019.06.024 · Cited by 465
Dynamic graph convolutional networks
Manessi, F., Rozza, A., & Manzo, M. (2020) · Pattern Recognition · doi:10.1016/j.patcog.2019.107000 · Cited by 446
Attributed Network Embedding for Learning in a Dynamic Environment
Li, J., Dani, H., Hu, X., Tang, J., Chang, Y., & Liu, H. (2017) · Proceedings of the 2017 ACM on Conference on Information and Knowledge Management · doi:10.1145/3132847.3132919 · Cited by 352
Embedding Temporal Network via Neighborhood Formation
Zuo, Y., Liu, G., Lin, H., Guo, J., Hu, X., & Wu, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3220054 · Cited by 282
DynGEM: Deep Embedding Method for Dynamic Graphs
Goyal, P., Kamra, N., He, X., & Liu, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1805.11273 · Cited by 272
Towards Sparse Hierarchical Graph Classifiers
Cangea, C., Veličković, P., Jovanović, N., Kipf, T., & Lió, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.01287 · Cited by 177
Predicting Organic Reaction Outcomes with Weisfeiler-Lehman Network
Jin, W., Coley, C. W., Barzilay, R., & Jaakkola, T. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1709.04555 · Cited by 165
Representation Learning over Dynamic GraphsPreprint
Trivedi, R., Farajtabar, M., Biswal, P., & Hongyuan Zha, B. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.04051 · Cited by 87
Learning Graph Dynamics using Deep Neural Networks
Narayan, A., & Roe, P. H. O. (2018) · IFAC-PapersOnLine · doi:10.1016/j.ifacol.2018.03.074 · Cited by 62
Chen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
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
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.