The main problem of the paper is the ability to train graph convolutional networks (GCNs) on dynamic graphs, which are graphs that change over time.
Applications:
The proposed method can be applied to various tasks such as dynamic graph prediction, node classification, and link prediction on dynamic graphs.
Existing Work:
The authors mention that existing works on dynamic graph analysis have primarily focused on static graphs and methods that can't capture the temporal dynamics of the graph. The proposed method aims to overcome these limitations.
WILL BE COMPLETED
Method:
The proposed method, called EvolveGCN, is based on the idea of developing GCNs. A GCN is trained on a sequence of snapshots of the dynamic graph, and the parameters of the GCN are updated at each time step using a technique called evolutionary graph convolution.
WILL BE COMPLETED
Input and output:
The input is a sequence of snapshots of the dynamic graph, and the output is a prediction for the future graph state.
Experimental Setup:
Dataset:
Stochastic Block Model (SBM): Random graph generating
Main problem:
The main problem of the paper is the ability to train graph convolutional networks (GCNs) on dynamic graphs, which are graphs that change over time.
Applications:
The proposed method can be applied to various tasks such as dynamic graph prediction, node classification, and link prediction on dynamic graphs.
Existing Work:
The authors mention that existing works on dynamic graph analysis have primarily focused on static graphs and methods that can't capture the temporal dynamics of the graph. The proposed method aims to overcome these limitations. WILL BE COMPLETED
Method:
The proposed method, called EvolveGCN, is based on the idea of developing GCNs. A GCN is trained on a sequence of snapshots of the dynamic graph, and the parameters of the GCN are updated at each time step using a technique called evolutionary graph convolution. WILL BE COMPLETED
Input and output:
The input is a sequence of snapshots of the dynamic graph, and the output is a prediction for the future graph state.
Experimental Setup:
Dataset:
Baselines:
Metrics:
Results:
Results for Link Prediction: Best method in terms of MAP and MRR for datasets:
Results for Edge Classification: Best method in terms of F1 for datasets:
Results for Node Classification: GCN-GRU beats EvolveGCN on this task. However, EvolveGCN performs better than static GCN.