Leveraging Meta-path Contexts for Classification in Heterogeneous Information Networks

Xiang Li, Danhao Ding, B. Kao, Yizhou Sun, N. Mamoulis

Main figure for Leveraging Meta-path Contexts for Classification in Heterogeneous Information Networks

Abstract

A heterogeneous information network (HIN) has as vertices objects of different types and as edges the relations between objects, which are also of various types. We study the problem of classifying objects in HINs. Most existing methods perform poorly when given scarce labeled objects as training sets, and methods that improve classification accuracy under such scenarios are often computationally expensive. To address these problems, we propose ConCH, a graph neural network model. ConCH\ formulates the classification problem as a multi-task learning problem that combines semi-supervised learning with self-supervised learning to learn from both labeled and unlabeled data. ConCH\ employs meta-paths, which are sequences of object types that capture semantic relationships between objects. Based on meta-paths, it considers two sources of information for an object $x$: (1) Meta-path-based neighbors of $x$ are retrieved and ranked, and the top-$k$ neighbors are retained. (2) The meta-path instances of $x$ to its selected neighbors are used to derive meta-path-based contexts. ConCH\ co-derives object embeddings and context embeddings via graph convolution. It also uses the attention mechanism to fuse such embeddings. We conduct extensive experiments to evaluate the performance of ConCH\ against other 15 classification methods. Our results show that ConCH\ is an effective and efficient method for HIN classification.

Proposed method: ConCH

Benchmark Results

Tested on 2 datasets

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

Heterogeneous Graph Benchmarks

#ModelMicro-F1 ↑Paper
1
LMSPS
0.9566 ±0.0020
2
PSHGCN
0.9561 ±0.0012
3
RpHGNN
0.9555 ±0.0029
17
ConCH
0.9470
This paper
21
GCN
actual #21 vs paper #45 24 places worse
0.9460 ±0.0031
best reported
actual #21 vs paper #45 24 places worse
paper 0.9310
paper 0.9310 Δ today 0.0150
22
MAGNN
0.9456
This paper
23
GAT
actual #23 vs paper #70 47 places worse
0.9448 ±0.0022
best reported
actual #23 vs paper #70 47 places worse
paper 0.9178
paper 0.9178 Δ today 0.0270
37
HAN
actual #37 vs paper #49 12 places worse
0.9291
actual #37 vs paper #49 12 places worse
paper 0.9291
prev best: Implicit Graph Neural Networks (NeurIPS 2020)
paper 0.9291 Δ at pub 0.2211 Δ today 0.0078
39
HGT
0.9365
This paper
43
HetGNN
0.9336
This paper
46
GraphSAGE
0.9306 ±0.0047
47
Mp2vec
0.9304
This paper
50
MVGRL
0.9289
This paper
52
Node2Vec
actual #52 vs paper #52
0.9282
actual #52 vs paper #52
paper 0.9282
prev best: Node Embedding over Temporal Graphs (IJCAI 2019)
paper 0.9282 Δ at pub 0.1762
61
HDGI
0.9233
This paper
82
HGCN
0.9009
This paper
176
MLP
0.6447 ±0.0136
#ModelMacro-F1 ↑Paper
1
ConCH
0.6475
This paper
2
HetGNN
0.6292
This paper
3
GC-HGNN
0.6247 ±0.0042
4
MAGNN
0.6223
This paper
5
HGT
0.6176
This paper
6
HDGI
0.6139
This paper
7
GCN
0.6090
This paper
9
HGCN
0.6035
This paper
10
HAN
0.6011
This paper
16
Mp2vec
0.5750
This paper
17
Node2Vec
0.5735
This paper
24
MVGRL
0.5115
This paper
25
GAT
0.5109
This paper
34
GraphSAGE
0.4417 ±0.0114
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers) Best at pub — reported value improved over the best known when published Improved at pub — later paper surpassed this result Best today — OK at publication; today's leaderboard best is elsewhere