Graph Representation Learning: A Survey

Fenxiao Chen, Yun Cheng Wang, Bin Wang, C.-C. Jay Kuo

Main figure for Graph Representation Learning: A Survey

Abstract

Research on graph representation learning has received a lot of attention in recent years since many data in real-world applications come in form of graphs. High-dimensional graph data are often in irregular form, which makes them more difficult to analyze than image/video/audio data defined on regular lattices. Various graph embedding techniques have been developed to convert the raw graph data into a low-dimensional vector representation while preserving the intrinsic graph properties. In this review, we first explain the graph embedding task and its challenges. Next, we review a wide range of graph embedding techniques with insights. Then, we evaluate several stat-of-the-art methods against small and large datasets and compare their performance. Finally, potential applications and future directions are presented.

Benchmark Results

Tested on 1 dataset

Tables show presented results in global context (best 3 papers + GCN + MLP).

Classic

#ModelAccuracy ↑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
435
DeepWalk
actual #435 vs paper #435
0.8290
actual #435 vs paper #435
paper 0.8290
645
Node2Vec
0.8030
This paper
697
LINE
actual #697 vs paper #907 210 places worse
0.7893 ±0.0055
best reported
actual #697 vs paper #907 210 places worse
paper 0.4320
paper 0.4320 Δ today 0.3573
704
GraRep
0.7880
This paper
724
MLP
0.7768
864
HOPE
0.6460
This paper
887
SDNE
0.5730
This paper
903
GF
0.4990
This paper
SOTA performance (not significantly different from the best) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported value improved over the best known when published Best today — OK at publication; today's leaderboard best is elsewhere