Mixed Graph Contrastive Network for Semi-Supervised Node Classification
Abstract
Graph Neural Networks (GNNs) have achieved promising performance in semi-supervised node classification in recent years. However, the problem of insufficient supervision, together with representation collapse, largely limits the performance of the GNNs in this field. To alleviate the collapse of node representations in semi-supervised scenario, we propose a novel graph contrastive learning method, termed Mixed Graph Contrastive Network (MGCN). In our method, we improve the discriminative capability of the latent embeddings by an interpolation-based augmentation strategy and a correlation reduction mechanism. Specifically, we first conduct the interpolation-based augmentation in the latent space and then force the prediction model to change linearly between samples. Second, we enable the learned network to tell apart samples across two interpolation-perturbed views through forcing the correlation matrix across views to approximate an identity matrix. By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discriminative representation learning. Extensive experimental results on six datasets demonstrate the effectiveness and the generality of MGCN compared to the existing state-of-the-art methods. The code of MGCN is available at https://github.com/xihongyang1999/MGCN on Github.
Benchmark Results
Tested on 6 datasets SOTA at publication on 1 35 baseline values reported too low
Tables show presented results in global context (best 3 papers + GCN + MLP).
Classic
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | CNA | 0.9575
±0.0058 | |
| 2 | IS-GIB | 0.9390
±0.0187 | |
| 3 | EERM | 0.9112
±0.0145 | |
| 20 | APPNP | 0.8142
±0.0026 best reported | best at pub: Tackling Over-Smoothing for General Graph Convolutional Networks (2020) best today: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 32 | GPRGNN | 0.8102
±0.0071 best reported | |
| 35 | GAT | 0.8080
±0.0026 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) best today: Feature Expansion for Graph Neural Networks (ICML 2023) |
| 44 | GCN | 0.8033
±0.0088 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 61 | GraphSAGE | 0.7923
±0.0053 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 66 | DGI | 0.7890
±0.0020 best reported | best at pub: Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization (2022) best today: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 87 | MVGRL | 0.7808
±0.0006 best reported | |
| 96 | SGC | 0.7765
±0.0012 best reported | |
| 136 | BGRL | 0.7600
±0.0020 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) best today: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 191 | GraphMix | 0.7470
±0.0059 best reported | best at pub: Metropolis-Hastings Data Augmentation for Graph Neural Networks (NeurIPS 2022) |
| 201 | GRACE | 0.7450
±0.0010 best reported | best at pub: Contrastive and Generative Graph Convolutional Networks for Graph-based Semi-Supervised Learning (AAAI 2020) best today: Oversmoothing: A Nightmare for Graph Contrastive Learning? (2023) |
| 259 | SAGE | 0.7361
±0.0190 | |
| 350 | MLP | 0.7289
±0.0010 best reported | best at pub: Block Modeling-Guided Graph Convolutional Neural Networks (AAAI 2021) best today: Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax (2025) |
| 505 | GCA | 0.7150
±0.0030 best reported | best at pub: Augmentation-Free Graph Contrastive Learning with Performance Guarantee (2022) Difference within reported uncertainty; not counted as underperformance. |
| 578 | JK-Net | 0.7070
±0.0070 best reported | best at pub: PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm (WWW 2022) |
| 647 | MGCN | 0.6918
±0.0043 | This paper |
| 701 | Graph Mixup | 0.6753
±0.0087 | This paper |
| 764 | GCN-Cheby | 0.6567
±0.0038 | This paper |
| 811 | AdaGCN | 0.6258
±0.0144 | This paper |
| 846 | MixupForGraph | 0.5741
±0.0033 | This paper |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9703
±0.0019 | |
| 2 | GAT | 0.9669
±0.0014 | |
| 3 | GAT+T | 0.9660
±0.0007 | |
| 7 | SAGE | 0.9643
±0.0027 | |
| 266 | MGCN | 0.9264
±0.0024 | This paper |
| 390 | MLP | 0.9128
±0.0063 |
| # | Model | Accuracy ↑ | Paper |
|---|---|---|---|
| 1 | GraphTARIF | 0.9461
±0.0017 | |
| 2 | GCN | 0.9412
±0.0008 | |
| 3 | GAT | 0.9398
±0.0022 | |
| 8 | SAGE | 0.9351
±0.0006 | |
| 320 | MLP | 0.8463 | |
| 353 | MGCN | 0.8399
±0.0090 | This paper |
Heterogeneous Graph Benchmarks
| # | Model | Micro-F1 ↑ | Paper |
|---|---|---|---|
| 1 | LMSPS | 0.9566
±0.0020 | |
| 2 | PSHGCN | 0.9561
±0.0012 | |
| 3 | RpHGNN | 0.9555
±0.0029 | |
| 21 | GCN | 0.9460
±0.0031 best reported | best at pub: Leveraging Meta-path Contexts for Classification in Heterogeneous Information Networks (2020) best today: Graph Neural Networks with a Distribution of Parametrized Graphs (ICML 2023) |
| 23 | GAT | 0.9448
±0.0022 best reported | best at pub: Heterogeneous Graph Benchmarks (KDD 2021) best today: Graph Neural Networks with a Distribution of Parametrized Graphs (ICML 2023) |
| 46 | GraphSAGE | 0.9306
±0.0047 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) best today: Efficient Heterogeneous Graph Learning via Random Projection (2023) |
| 50 | MVGRL | 0.9289 best reported | |
| 60 | GPRGNN | 0.9245
±0.0076 best reported | best today: Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials (WWW 2023) |
| 74 | GRACE | 0.9128
±0.0007 best reported | best today: Heterogeneous Graph Contrastive Multi-view Learning (2022) |
| 79 | DGI | 0.9016
±0.0060 best reported | best at pub: Implicit Graph Neural Networks (NeurIPS 2020) best today: Heterogeneous Graph Contrastive Multi-view Learning (2022) |
| 88 | GIN | 0.8720 | |
| 111 | APPNP | 0.8440
±0.0017 best reported | best at pub: Gophormer: Ego-Graph Transformer for Node Classification (2021) |
| 112 | GCA | 0.8399
±0.0021 best reported | best today: Perfect Alignment May be Poisonous to Graph Contrastive Learning (ICML 2023) |
| 130 | BGRL | 0.8070 best reported | best today: Relational Self-Supervised Learning on Graphs (2022) |
| 166 | MGCN | 0.7130 best reported | best at pub: Implicit Graph Neural Networks (NeurIPS 2020) |
| 168 | AdaGCN | 0.6970
±0.0135 | This paper |
| 172 | MixupForGraph | 0.6851
±0.0078 | This paper |
| 173 | Graph Mixup | 0.6848
±0.0152 | This paper |
| 174 | GraphMix | 0.6798
±0.0036 | This paper |
| 175 | JK-Net | 0.6451
±0.0053 | This paper |
| 176 | MLP | 0.6447
±0.0136 best reported | best today: GraphControl: Adding Conditional Control to Universal Graph Pre-trained Models for Graph Domain Transfer Learning (WWW 2023) Difference within reported uncertainty; not counted as underperformance. |
| 177 | SGC | 0.6230
±0.0009 best reported | best today: Multiplex Heterogeneous Graph Convolutional Network (KDD 2022) |
| 180 | GCN-Cheby | 0.6048 | This paper |
ACM
Global leaderboard →Default metric is Micro-F1. The paper reports 19 values on Micro-F1 and 1 value on Accuracy .
| # | Model | Micro-F1 ↑ default | Accuracy ↑ | Paper |
|---|---|---|---|---|
| 1 | LMSPS | 0.9469
±
0.0036 | — | |
| 2 | PSHGCN | 0.9427
±
0.0023 | — | |
| 3 | SlotGAT | 0.9406
±
0.0022 | — | |
| 19 | GAT | 0.9273 best reported | — | Accuracy
— best at pub: Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs (NeurIPS 2020) |
| 29 | GCN | 0.9229 best reported | — | Accuracy
— best at pub: Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs (NeurIPS 2020) |
| 30 | GPRGNN | 0.9228
±0.0027 best reported | — | Accuracy
— best today: Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials (WWW 2023) |
| 31 | SGC | 0.9224 best reported | — | Accuracy
— best at pub: Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs (NeurIPS 2020) |
| 49 | GIN | 0.9092 | — | |
| 52 | GraphSAGE | 0.9063
±0.0076 best reported | — | Accuracy
— best today: Efficient Heterogeneous Graph Learning via Random Projection (2023) |
| 74 | DGI | 0.8844
±0.0030 best reported | — | Accuracy
— best at pub: Implicit Graph Neural Networks (NeurIPS 2020) best today: Heterogeneous Graph Contrastive Multi-view Learning (2022) |
| 79 | MVGRL | 0.8803
±0.0138 best reported | — | Accuracy
— best today: Geometry Contrastive Learning on Heterogeneous Graphs (2022) |
| 81 | MGCN | 0.8788
±0.0054 | 0.8788
±
0.0054 | Accuracy
0.8788
±
0.0054 prev best: Implicit Graph Neural Networks (NeurIPS 2020) |
| 84 | GRACE | 0.8764
±0.0031 best reported | — | Accuracy
— best today: Heterogeneous Graph Contrastive Multi-view Learning (2022) |
| 88 | Graph Mixup | 0.8644
±
0.0125 | — | Accuracy
— |
| 89 | MixupForGraph | 0.8624
±
0.0062 | — | Accuracy
— |
| 90 | AdaGCN | 0.8609
±
0.0199 | — | Accuracy
— |
| 93 | BGRL | 0.8604
±
0.0067 | — | Accuracy
— |
| 94 | GraphMix | 0.8575
±
0.0055 | — | Accuracy
— |
| 101 | JK-Net | 0.8120
±
0.0011 | — | Accuracy
— |
| 103 | GCN-Cheby | 0.7998
±
0.0307 | — | Accuracy
— |
| 104 | GCA | 0.7923
±
0.0173 | — | Accuracy
— |
| 106 | APPNP | 0.7461
±
0.0067 | — | Accuracy
— |
| 109 | MLP | 0.7102
±
0.0221 | — | Accuracy
— |
