GANN: Graph Alignment Neural Network for Semi-Supervised Learning
Abstract
Graph neural networks (GNNs) have been widely investigated in the field of semi-supervised graph machine learning. Most methods fail to exploit adequate graph information when labeled data is limited, leading to the problem of oversmoothing. To overcome this issue, we propose the Graph Alignment Neural Network (GANN), a simple and effective graph neural architecture. A unique learning algorithm with three alignment rules is proposed to thoroughly explore hidden information for insufficient labels. Firstly, to better investigate attribute specifics, we suggest the feature alignment rule to align the inner product of both the attribute and embedding matrices. Secondly, to properly utilize the higher-order neighbor information, we propose the cluster center alignment rule, which involves aligning the inner product of the cluster center matrix with the unit matrix. Finally, to get reliable prediction results with few labels, we establish the minimum entropy alignment rule by lining up the prediction probability matrix with its sharpened result. Extensive studies on graph benchmark datasets demonstrate that GANN can achieve considerable benefits in semi-supervised node classification and outperform state-of-the-art competitors.
Benchmark Results
Tested on 3 datasets 3 baseline values reported too low Non-standard metric on 3 datasets
Tables show presented results in global context (best 3 papers + GCN + MLP).
Heterogeneous Graph Benchmarks
DBLP
Global leaderboard →Sorted by Accuracy. Highlighted rows are from other papers.
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | HG-SCM | 0.9490
±0.0015 | |
| 2 | SeHGNN | 0.9489
±0.0018 | |
| 3 | AdvSynGNN | 0.9486
±0.0012 | |
| 31 | GAT | 0.8859
±0.0010 best reported | best at pub: I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs (AAAI 2022) |
| 36 | GCN | 0.8758
±0.0020 best reported | best at pub: I'm Me, We're Us, and I'm Us: Tri-directional Contrastive Learning on Hypergraphs (AAAI 2022) |
| 60 | GANN | 0.8204
±0.0022 | This paper |
| 61 | SGC | 0.8170 best reported | best at pub: Deep Graph Contrastive Representation Learning (2020) |
| 65 | MLP | 0.8118
±0.0020 | |
| 66 | GPRGNN | 0.8092
±0.0020 | This paper |
| 70 | AdaGCN | 0.8045
±0.0083 | This paper |
| 71 | PPNP | 0.8040
±0.0042 | This paper |
| 72 | GCN-Cheby | 0.8033
±0.0097 | This paper |
| 73 | FAGCN | 0.7998
±0.0089 | This paper |
| 75 | JK-Net | 0.7962
±0.0058 | This paper |
| 76 | APPNP | 0.7962
±0.0074 | This paper |
| 78 | GWNN | 0.7927
±0.0054 | This paper |
| 80 | V. GCN | 0.7832
±0.0078 | This paper |
| 105 | GraphSAGE | 0.7455
±0.0061 | |
| 106 | MixupForGraph | 0.7429
±0.0071 | This paper |
ACM
Global leaderboard →Sorted by Accuracy. Highlighted rows are from other papers.
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | SignGT | 0.9545
±0.0049 | |
| 2 | NodeFormer | 0.9493
±0.0035 | |
| 3 | FAGCN | 0.9487
±0.0059 best reported | |
| 7 | GAT | 0.9424
±0.0043 best reported | |
| 26 | SGC | 0.9175
±0.0048 | prev best: AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter (2021) best today: Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers (NeurIPS 2024) |
| 29 | GANN | 0.9323
±0.0034 | This paper |
| 32 | APPNP | 0.9300
±0.0055 best reported | best today: Leveraging Contrastive Learning for Enhanced Node Representations in Tokenized Graph Transformers (NeurIPS 2024) |
| 34 | GCN | 0.9185
±0.0040 | prev best: AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter (2021) |
| 39 | PPNP | 0.9164
±0.0044 | This paper |
| 42 | V. GCN | 0.9106
±0.0044 | This paper |
| 43 | GCN-Cheby | 0.9101
±0.0056 | This paper |
| 46 | JK-Net | 0.9056
±0.0056 | This paper |
| 51 | MixupForGraph | 0.8933
±0.0059 | This paper |
| 67 | GraphSAGE | 0.7529
±0.0020 |
Hypergraph Benchmarks
AMAP
Global leaderboard →Sorted by F1. Highlighted rows are from other papers.
| # | Model | F1 ↑ | Paper |
|---|---|---|---|
| 1 | GANN | 0.9405
±0.0037 | This paper |
| 2 | GPRGNN | 0.9308
±0.0026 | This paper |
| 3 | GAT | 0.9238
±0.0014 | This paper |
| 4 | JK-Net | 0.9168
±0.0082 | This paper |
| 5 | GCN-Cheby | 0.9156
±0.0075 | This paper |
| 6 | GWNN | 0.9075
±0.0126 | This paper |
| 7 | SGC | 0.9017
±0.0075 | This paper |
| 8 | FAGCN | 0.9006
±0.0104 | This paper |
| 9 | MixupForGraph | 0.8728
±0.0108 | This paper |
| 10 | PPNP | 0.8627
±0.0074 | This paper |
| 11 | APPNP | 0.8602
±0.0076 | This paper |
| 13 | V. GCN | 0.8141
±0.0147 | This paper |
| 14 | GCN | 0.8115
±0.0105 | This paper |
