Collaborative Graph Neural Networks for Attributed Network Embedding

Qiaoyu Tan, Xin Zhang, Xiao Huang, Haojun Chen, Jundong Li, Xia Hu

Main figure for Collaborative Graph Neural Networks for Attributed Network Embedding

Abstract

Graph neural networks (GNNs) have shown prominent performance on attributed network embedding. However, existing efforts mainly focus on exploiting network structures, while the exploitation of node attributes is rather limited as they only serve as node features at the initial layer. This simple strategy impedes the potential of node attributes in augmenting node connections, leading to limited receptive field for inactive nodes with few or even no neighbors. Furthermore, the training objectives (i.e., reconstructing network structures) of most GNNs also do not include node attributes, although studies have shown that reconstructing node attributes is beneficial. Thus, it is encouraging to deeply involve node attributes in the key components of GNNs, including graph convolution operations and training objectives. However, this is a nontrivial task since an appropriate way of integration is required to maintain the merits of GNNs. To bridge the gap, in this paper, we propose COllaborative graph Neural Networks--CONN, a tailored GNN architecture for attribute network embedding. It improves model capacity by 1) selectively diffusing messages from neighboring nodes and involved attribute categories, and 2) jointly reconstructing node-to-node and node-to-attribute-category interactions via cross-correlation. Experiments on real-world networks demonstrate that CONN excels state-of-the-art embedding algorithms with a great margin.

Proposed method: CONN

Benchmark Results

Tested on 2 datasets Non-standard metric on 2 datasets

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

Classic

Reddit

Global leaderboard →

Default metric is F1. The paper reports 0 values on F1 , 11 values on F1-micro and 9 values on F1-macro .

Sorted by F1-micro. Highlighted rows are from other papers.

#ModelF1 ↑ defaultF1-micro ↑F1-macro ↑Paper
1
LaGraph
0.9520 ± 0.0000
—
—
2
GraphAKD
0.9515 ± 0.0002
—
—
3
GMI-mean
0.9500 ± 0.0002
—
—
6
GCN
0.9412 ± 0.0004
—
—
11
CONN
—
0.9130
0.8790
F1 —
F1-macro 0.8790
This paper
13
CAN
—
0.8200
0.7260
F1 —
F1-macro 0.7260
This paper
14
GCA
—
0.7520
0.6390
F1 —
F1-macro 0.6390
This paper
15
DSGC
—
0.6930
0.6110
F1 —
F1-macro 0.6110
This paper
16
FeatWalk
—
0.6630
0.5030
F1 —
F1-macro 0.5030
This paper
17
MAGNN
—
0.6590
—
F1 —
F1-macro —
This paper
18
HetGNN
—
0.6460
—
F1 —
F1-macro —
This paper
19
ARGE
—
0.6450
0.6010
F1 —
F1-macro 0.6010
This paper
20
GAE
—
0.6240
0.4670
F1 —
F1-macro 0.4670
This paper
21
GIC
—
0.6220
0.4330
F1 —
F1-macro 0.4330
This paper
22
DGI
—
0.6050
0.4180
F1 —
F1-macro 0.4180
This paper

Heterogeneous Graph Benchmarks

ACM

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

Sorted by F1-micro. Highlighted rows are from other papers.

#ModelF1-micro ↑Paper
1
CONN
0.7750
This paper
2
DGI
0.7680
This paper
3
FeatWalk
0.7600
This paper
4
DSGC
0.7590
This paper
5
GCA
0.7570
This paper
6
GIC
0.7540
This paper
7
ARGE
0.7360
This paper
8
MAGNN
0.7260
This paper
9
HetGNN
0.7240
This paper
10
CAN
0.7210
This paper
11
GAE
0.7100
This paper
SOTA performance (not significantly different from the best) Proposed method (this paper) Baseline / comparison (this paper) Global context (other papers)