Dynamic Graph Convolutional Networks
Abstract
Many different classification tasks need to manage structured data, which are usually modeled as graphs. Moreover, these graphs can be dynamic, meaning that the vertices/edges of each graph may change during time. Our goal is to jointly exploit structured data and temporal information through the use of a neural network model. To the best of our knowledge, this task has not been addressed using these kind of architectures. For this reason, we propose two novel approaches, which combine Long Short-Term Memory networks and Graph Convolutional Networks to learn long short-term dependencies together with graph structure. The quality of our methods is confirmed by the promising results achieved.
Benchmark Results
Tested on 1 dataset Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterogeneous Graph Benchmarks
DBLP
Global leaderboard →Sorted by Unweighted F1 Measure. Highlighted rows are from other papers.
| # | Model | Unweighted F1 Measure ↑ | Paper |
|---|---|---|---|
| 1 | WD-GCN | 0.7070
±0.0240 | This paper |
| 2 | CD-GCN | 0.7050
±0.0270 | This paper |
| 3 | FC+LSTM+FC | 0.6180
±0.0240 | This paper |
| 4 | LSTM+FC | 0.6040
±0.0230 | This paper |
| 5 | GC+GC | 0.5470
±0.0170 | This paper |
| 6 | FC+FC | 0.4820
±0.0130 | This paper |
