A Comprehensive Survey on Graph Neural Networks
Abstract
Deep learning has revolutionized many machine learning tasks in recent years, ranging from image classification and video processing to speech recognition and natural language understanding. The data in these tasks are typically represented in the Euclidean space. However, there is an increasing number of applications where data are generated from non-Euclidean do- mains and are represented as graphs with complex relationships and interdependency between objects. The complexity of graph data has imposed significant challenges on existing machine learning algorithms. Recently, many studies on extending deep learning approaches for graph data have emerged. In this survey, we provide a comprehensive overview of graph neural networks (GNNs) in data mining and machine learning fields. We propose a new taxonomy to divide the state-of-the-art graph neural networks into four categories, namely recurrent graph neural networks, convolutional graph neural networks, graph autoencoders, and spatial-temporal graph neural networks. We further discuss the applications of graph neural networks across various domains and summarize the open source codes, benchmark data sets, and model evaluation of graph neural networks. Finally, we propose potential research directions in this rapidly growing field.
Benchmark Results
Tested on 5 datasets
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphSAGE+CNA | 0.9418
±0.0033 | |
| 2 | GCN+CNA | 0.9366
±0.0048 | |
| 3 | TransformerConv | 0.9350
±0.0058 | |
| 21 | GCN | 0.9004 | |
| 375 | DualGCN (2018) | 0.8350 | This paper |
| 399 | LGCN (2018) | 0.8330 | This paper |
| 432 | GAT (2017) | 0.8300 | This paper |
| 498 | DGI (2018) | 0.8230 | This paper |
| 535 | StoGCN (2018) | 0.8200 | This paper |
| 548 | Cayleynets (2017) | 0.8190 | This paper |
| 568 | MoNet (2017) | 0.8169 | This paper |
| 578 | GCN (2016) | 0.8150 | This paper |
| 724 | MLP | 0.7768 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 44 | GCN | 0.8033
±0.0088 | |
| 334 | LGCN (2018) | 0.7300 | This paper |
| 350 | MLP | 0.7289
±0.0010 | |
| 383 | DualGCN (2018) | 0.7260 | This paper |
| 402 | GAT (2017) | 0.7250 | This paper |
| 475 | DGI (2018) | 0.7180 | This paper |
| 567 | StoGCN (2018) | 0.7090 | This paper |
| 608 | GCN (2016) | 0.7030 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | LGTL | 0.9518
±0.0011 | |
| 2 | MixHop (LO) | 0.9513
±0.0038 | |
| 3 | GraphSAGE (LO) | 0.9511
±0.0036 | |
| 18 | GCN | 0.9296
±0.0015 | |
| 210 | MLP | 0.8690
±0.0074 | |
| 456 | DualGCN (2018) | 0.8000 | This paper |
| 517 | LGCN (2018) | 0.7950 | This paper |
| 597 | GCN (2016) | 0.7900 | This paper |
| 598 | GAT (2017) | 0.7900 | This paper |
| 614 | MoNet (2017) | 0.7881 | This paper |
| 628 | StoGCN (2018) | 0.7870 | This paper |
| 642 | GeniePath (2019) | 0.7850 | This paper |
| 746 | DGI (2018) | 0.7680 | This paper |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | EnGCN | 0.9714
±0.0003 | |
| 2 | SAGN+SLE | 0.9710 | |
| 3 | GAMLP(JK) | 0.9704
±0.0001 | |
| 7 | GAAN (2018) | 0.9683 | This paper |
| 20 | Cluster-GCN (2019) | 0.9660 | This paper |
| 14 | GraphSAGE | 0.9660 | |
| 32 | StoGCN (2018) | 0.9630 | This paper |
| 33 | Huang et al. (2018) | 0.9627 | This paper |
| 56 | GraphSage (2017) | 0.9540 | This paper |
| 86 | DGI (2018) | 0.9400 | This paper |
| 93 | FastGCN (2018) | 0.9370 | This paper |
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GAMLP(JK) | 0.9982
±0.0001 | |
| 2 | GraphCON-GCN | 0.9960 | |
| 3 | GCNII | 0.9953
±0.0001 | |
| 9 | Cluster-GCN | 0.9940 best reported | best today: Graph-Coupled Oscillator Networks (ICML 2022) |
| 17 | GaAN | 0.9871 | This paper |
| 22 | GeniePath | 0.9850 best reported | best today: Graph-Coupled Oscillator Networks (ICML 2022) |
| 21 | GCN | 0.9850 | |
| 44 | StoGCN | 0.9780 | This paper |
| 57 | GAT | 0.9732
±0.0032 best reported | best at pub: GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs (2018) best today: HAT-GAE: Self-Supervised Graph Auto-encoders with Hierarchical Adaptive Masking and Trainable Corruption (2023) Difference within reported uncertainty; not counted as underperformance. |
| 97 | SSE | 0.8360 | This paper |
| 101 | GraphSAGE | 0.7860 best reported | best at pub: GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs (2018) best today: Optimization-Induced Graph Implicit Nonlinear Diffusion (ICML 2022) |
| 103 | LGCN | 0.7720 | This paper |
| 148 | DGI | 0.6380 | This paper |
| 173 | MLP | 0.4620 |
