EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphs
EvolveGCN: Эволюционирующие графовые сверточные сети для динамических графов
2020-04-03
SCID: 54.1/utj7fsw2
Discuss with AI
EvolveGCNdynamic graphsgraph convolutional networkslink predictiontemporal graph representation learning
Figures from the paper
Abstract (AI)
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.
Key Findings
1
An RNN captures temporal graph dynamics by updating GCN parameters, enabling adaptation to changing graph structures.
2
EvolveGCN models dynamic graphs by evolving GCN parameters over time rather than maintaining node embeddings.
3
Experiments on link prediction, edge classification, and node classification show generally higher performance than related approaches.
4
The approach does not require knowing node identities across the full training and testing period, addressing frequently changing or entirely different node sets.
5
Two architectures are introduced for evolving GCN parameters along the temporal dimension.
Research Object
dynamic graph sequences
Research Subject
temporal evolution of graph convolutional network parameters for graph representation learning without node embeddings
Publication Details
Publication Date
2020-04-03
Journal
Publisher
ISSN
Access Type
Author Information
Download PDF
Subscribe to digest