AAAI 2019

Graph Few-shot Learning via Knowledge Transfer

Huaxiu Yao, Chuxu Zhang, Ying Wei, Meng Jiang, Suhang Wang, Junzhou Huang, N. Chawla, Z. Li

Main figure for Graph Few-shot Learning via Knowledge Transfer

Abstract

Towards the challenging problem of semi-supervised node classification, there have been extensive studies. As a frontier, Graph Neural Networks (GNNs) have aroused great interest recently, which update the representation of each node by aggregating information of its neighbors. However, most GNNs have shallow layers with a limited receptive field and may not achieve satisfactory performance especially when the number of labeled nodes is quite small. To address this challenge, we innovatively propose a graph few-shot learning (GFL) algorithm that incorporates prior knowledge learned from auxiliary graphs to improve classification accuracy on the target graph. Specifically, a transferable metric space characterized by a node embedding and a graph-specific prototype embedding function is shared between auxiliary graphs and the target, facilitating the transfer of structural knowledge. Extensive experiments and ablation studies on four real-world graph datasets demonstrate the effectiveness of our proposed model and the contribution of each component.

Proposed method: GFL-att

Benchmark Results

Tested on 1 dataset Non-standard metric on 1 dataset

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

Classic

Reddit

Global leaderboard →
Non-default metric. This paper reports Accuracy; the dataset default is F1. Values below use Accuracy only.

Sorted by Accuracy. Highlighted rows are from other papers.

#ModelAccuracy ↑Paper
1
GAP-EDP
0.9870 ±0.0003
2
NE-ASGCN
0.9758 ±0.0027
3
HSGT
0.9730 ±0.0024
21
GraphSAGE
0.9653 ±0.0011
92
Node2Vec
actual #92 vs paper #166 74 places worse
0.9326 ±0.0004
best reported
actual #92 vs paper #166 74 places worse
paper 0.4357 ±0.0223
paper 0.4357 ±0.0223 Δ today 0.4969
147
MLP
0.8240 ±0.0010
155
GFL-att
0.6314 ±0.0051
This paper
156
GFL-mean
0.6266 ±0.0057
This paper
159
ProtoNet
0.6046 ±0.0067
This paper
160
MAML
0.5939 ±0.0028
This paper
162
Matchingnet
0.5621 ±0.0187
This paper
163
K-NN
0.5606 ±0.0136
This paper
164
All-Graph-Finetune (AGF)
0.5413 ±0.0057
This paper
165
Planetoid
0.5097 ±0.0381
This paper
166
Non-transfer-GCN
0.4621 ±0.0143
This paper
168
DeepWalk
0.3481 ±0.0281
This paper
176
LP
0.2340 ±0.0163
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best today — OK at publication; today's leaderboard best is elsewhere