Label-Enhanced Graph Neural Network for Semi-supervised Node Classification

Le Yu, Leilei Sun, Bowen Du, T. Zhu, Weifeng Lv

Main figure for Label-Enhanced Graph Neural Network for Semi-supervised Node Classification

Abstract

Graph Neural Networks (GNNs) have been widely applied in the semi-supervised node classification task, where a key point lies in how to sufficiently leverage the limited but valuable label information. Most of the classical GNNs solely use the known labels for computing the classification loss at the output. In recent years, several methods have been designed to additionally utilize the labels at the input. One part of the methods augment the node features via concatenating or adding them with the one-hot encodings of labels, while other methods optimize the graph structure by assuming neighboring nodes tend to have the same label. To bring into full play the rich information of labels, in this paper, we present a label-enhanced learning framework for GNNs, which first models each label as a virtual center for intra-class nodes and then jointly learns the representations of both nodes and labels. Our approach could not only smooth the representations of nodes belonging to the same class, but also explicitly encode the label semantics into the learning process of GNNs. Moreover, a training node selection technique is provided to eliminate the potential label leakage issue and guarantee the model generalization ability. Finally, an adaptive self-training strategy is proposed to iteratively enlarge the training set with more reliable pseudo labels and distinguish the importance of each pseudo-labeled node during the model training process. Experimental results on both real-world and synthetic datasets demonstrate our approach can not only consistently outperform the state-of-the-arts, but also effectively smooth the representations of intra-class nodes.

Benchmark Results

Tested on 1 dataset 2 baseline values reported too low

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

OGB

#ModelAccuracy ↑Paper
1
LMSPS+LP+MS
0.5784 ±0.0022
2
SeHGNN+emb+ms
0.5719 ±0.0012
3
SeHGNN+ms
0.5671 ±0.0014
23
LEGNN
actual #23 vs paper #27 4 places worse
0.5378
best reported
actual #23 vs paper #27 4 places worse
paper 0.5276 ±0.0014
paper 0.5276 ±0.0014 Δ today 0.0102
24
LEGNN + AS-Train
0.5378 ±0.0016
This paper
27
SIGN
actual #27 vs paper #63 36 places worse
0.5289 ±0.0011
best reported
actual #27 vs paper #63 36 places worse
paper 0.4046 ±0.0012
paper 0.4046 ±0.0012 Δ at pub 0.0764 Δ today 0.1243
40
HGConv
0.5045 ±0.0017
This paper
41
R-GSN
0.5032 ±0.0037
This paper
42
HGT
actual #42 vs paper #45 3 places worse
0.5023 ±0.0048
best reported
actual #42 vs paper #45 3 places worse
paper 0.4927 ±0.0061
48
RGCN
actual #48 vs paper #56 8 places worse
0.4811 ±0.0048
best reported
actual #48 vs paper #56 8 places worse
paper 0.4678 ±0.0067
paper 0.4678 ±0.0067 Δ at pub 0.0118 Δ today 0.0133
57
GraphSAGE
0.4646 ±0.0060
71
MetaPath2Vec
0.3544 ±0.0036
This paper
76
MLP
0.3243
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported result worse than the best known when published (best reported in green) Best today — OK at publication; today's leaderboard best is elsewhere