EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs

Aldo Pareja, Giacomo Domeniconi, Jie Chen, Tengfei Ma, Toyotaro Suzumura +4 more
2/26/2019
cs.LGcs.SIstat.ML

Official code: IBM/EvolveGCN (620 stars, Apache-2.0, last commit 2021-10-11). 1 more implementation below.

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 \url{https://github.com/IBM/EvolveGCN}.

View on arXivView PDF

Code Implementations(2)

IBM/EvolveGCNOfficial100%
Apache-2.0

Code for EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs

620173Python, DockerfileOct 3, 20195 years agoApache-2.0
IBM/AMLSimCommunity100%
Apache-2.0

The AMLSim project is intended to provide a multi-agent based simulator that generates synthetic banking transaction data together with a set of known money laundering patterns - mainly for the purpose of testing machine learning models and graph algorithms. We welcome you to enhance this effort since the data set related to money laundering is critical to advance detection capabilities of money laundering activities.

370113Java, ShellDec 18, 20181 years agoApache-2.0
financefinance-applicationfraud-detectiongraphnetwork-science+1 more

Cite this paper

@article{pareja2019evolvegcn,
  title  = {EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs},
  author = {Aldo Pareja and Giacomo Domeniconi and Jie Chen and Tengfei Ma and Toyotaro Suzumura and Hiroki Kanezashi and Tim Kaler and Tao B. Schardl and Charles E. Leiserson},
  year   = {2019},
  eprint = {1902.10191},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1902.10191}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1902.10191.svg)](https://codeofpaper.com/paper/1902.10191)

Discussion