Heterogeneous Graph Contrastive Multi-view Learning
Abstract
Inspired by the success of Contrastive Learning (CL) in computer vision and natural language processing, Graph Contrastive Learning (GCL) has been developed to learn discriminative node representations on graph datasets. However, the development of GCL on Heterogeneous Information Networks (HINs) is still in the infant stage. For example, it is unclear how to augment the HINs without substantially altering the underlying semantics, and how to design the contrastive objective to fully capture the rich semantics. Moreover, early investigations demonstrate that CL suffers from sampling bias, whereas conventional debiasing techniques are empirically shown to be inadequate for GCL. How to mitigate the sampling bias for heterogeneous GCL is another important problem. To address the aforementioned challenges, we propose a novel Heterogeneous Graph Contrastive Multi-view Learning (HGCML) model. In particular, we use metapaths as the augmentation to generate multiple subgraphs as multi-views, and propose a contrastive objective to maximize the mutual information between any pairs of metapath-induced views. To alleviate the sampling bias, we further propose a positive sampling strategy to explicitly select positives for each node via jointly considering semantic and structural information preserved on each metapath view. Extensive experiments demonstrate HGCML consistently outperforms state-of-the-art baselines on five real-world benchmark datasets. To enhance the reproducibility of our work, we make all the code publicly available at https://github.com/Zehong-Wang/HGCML.: Graph contrastive learning, heterogeneous information network, self-supervised learning, graph neural network, multi-view learning.
Benchmark Results
Tested on 4 datasets 10 baseline values reported too low Non-standard metric on 1 dataset
Tables show presented results in global context (best 3 papers + GCN + MLP).
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) Difference within reported uncertainty; not counted as underperformance. |
| 37 | HAN | 0.9327
±0.0058 | prev best: Leveraging Meta-path Contexts for Classification in Heterogeneous Information Networks (2020) Improvement within reported uncertainty; not highlighted. |
| 40 | HGCML-P | 0.9344
±0.0008 | This paper |
| 44 | DMGI | 0.9160
±0.0066 | prev best: Multiplex Heterogeneous Graph Convolutional Network (KDD 2022) |
| 45 | HGCML | 0.9329
±0.0012 | This paper |
| 46 | GraphSAGE | 0.9306
±0.0047 | |
| 47 | Mp2vec | 0.9304 best reported | |
| 57 | STENCIL | 0.9256
±0.0022 | This paper |
| 62 | HeCo | 0.9224
±0.0048 | This paper |
| 72 | HIN2Vec | 0.9140
±0.0008 | This paper |
| 74 | GRACE | 0.9128
±0.0007 | prev best: Geometry Contrastive Learning on Heterogeneous Graphs (2022) |
| 75 | HERec | 0.9075
±0.0039 | This paper |
| 79 | DGI | 0.9016
±0.0060 | prev best: Geometry Contrastive Learning on Heterogeneous Graphs (2022) |
| 81 | DeepWalk | 0.8809
±0.0007 | prev best: Implicit Graph Neural Networks (NeurIPS 2020) best today: Generative-Contrastive Heterogeneous Graph Neural Network (2024) |
| 176 | MLP | 0.6447
±0.0136 |
| # | Model | Micro-F1 ↑ | 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 | best at pub: Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs (NeurIPS 2020) |
| 29 | GCN | 0.9229 best reported | best at pub: Self-supervised Auxiliary Learning with Meta-paths for Heterogeneous Graphs (NeurIPS 2020) |
| 43 | HAN | 0.9147
±0.0022 best reported | best at pub: Heterogeneous Graph Benchmarks (KDD 2021) best today: Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning (NeurIPS 2024) |
| 45 | HGCML-P | 0.9134
±0.0017 | This paper |
| 48 | HGCML | 0.9102
±0.0013 | This paper |
| 49 | GIN | 0.9092 | |
| 64 | DMGI | 0.8980
±0.0010 best reported | best at pub: Implicit Graph Neural Networks (NeurIPS 2020) best today: Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective (NeurIPS 2024) |
| 68 | HeCo | 0.8897
±0.0112 | This paper |
| 74 | DGI | 0.8844
±0.0030 | prev best: Implicit Graph Neural Networks (NeurIPS 2020) Improvement within reported uncertainty; not highlighted. |
| 76 | STENCIL | 0.8823
±0.0091 | This paper |
| 77 | Mp2vec | 0.8810
±0.0030 best reported | best today: Revisiting Self-Supervised Heterogeneous Graph Learning from Spectral Clustering Perspective (NeurIPS 2024) |
| 84 | GRACE | 0.8764
±0.0031 | prev best: Mixed Graph Contrastive Network for Semi-Supervised Node Classification (2022) |
| 95 | HIN2Vec | 0.8523
±0.0009 | This paper |
| 100 | DeepWalk | 0.8178
±0.0004 | prev best: Geometry Contrastive Learning on Heterogeneous Graphs (2022) |
| 107 | HERec | 0.7445
±0.0045 best reported | best today: Generative-Contrastive Heterogeneous Graph Neural Network (2024) |
| 109 | MLP | 0.7102
±0.0221 |
| # | Model | Micro-F1 ↑ | Paper |
|---|---|---|---|
| 1 | ELLA | 0.7930
±0.0010 | |
| 2 | MHGCN | 0.7820
±0.0138 | |
| 3 | PSHGCN | 0.7446
±0.0032 | |
| 14 | GCN | 0.6813
±0.0083 best reported | best at pub: Heterogeneous Graph Benchmarks (KDD 2021) best today: Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials (WWW 2023) |
| 15 | GAT | 0.6808
±0.0049 best reported | best at pub: Heterogeneous Graph Benchmarks (KDD 2021) best today: Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials (WWW 2023) |
| 18 | HAN | 0.6769
±0.0064 best reported | best at pub: Heterogeneous Graph Benchmarks (KDD 2021) best today: Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials (WWW 2023) |
| 33 | DMGI | 0.6480 best reported | best at pub: Implicit Graph Neural Networks (NeurIPS 2020) best today: Relational Self-Supervised Learning on Graphs (2022) |
| 37 | GRACE | 0.6407
±0.0080 best reported | best at pub: Geometry Contrastive Learning on Heterogeneous Graphs (2022) |
| 44 | GraphSAGE | 0.6276 | |
| 50 | HGCML-P | 0.6102
±0.0049 | This paper |
| 52 | HGCML | 0.6075
±0.0071 | This paper |
| 54 | DGI | 0.6060 best reported | best at pub: Implicit Graph Neural Networks (NeurIPS 2020) |
| 63 | STENCIL | 0.5783
±0.0062 | This paper |
| 68 | DeepWalk | 0.5636
±0.0033 | prev best: Implicit Graph Neural Networks (NeurIPS 2020) |
| 74 | MLP | 0.5514 | |
| 82 | HeCo | 0.5212
±0.0072 | This paper |
| 85 | Mp2vec | 0.5078
±0.0018 | This paper |
| 86 | HIN2Vec | 0.5073
±0.0023 | This paper |
| 89 | HERec | 0.4912
±0.0022 | This paper |
Freebase
Global leaderboard →Sorted by Micro-F1. Highlighted rows are from other papers.
| # | Model | Micro-F1 ↑ | Paper |
|---|---|---|---|
| 1 | HGCML-P | 0.7153
±0.0014 | This paper |
| 2 | HGCML | 0.7141
±0.0004 | This paper |
| 3 | HAN | 0.7098
±0.0107 | This paper |
| 4 | GAT | 0.7042
±0.0055 | This paper |
| 5 | Mp2vec | 0.6966
±0.0011 | This paper |
| 6 | DeepWalk | 0.6963
±0.0005 | This paper |
| 7 | GRACE | 0.6925
±0.0014 | This paper |
| 8 | GCN | 0.6913
±0.0251 | This paper |
| 9 | HeCo | 0.6902
±0.0007 | This paper |
| 10 | DGI | 0.6842
±0.0031 | This paper |
| 11 | STENCIL | 0.6826
±0.0021 | This paper |
| 12 | HERec | 0.6804
±0.0019 | This paper |
| 13 | DMGI | 0.6769
±0.0021 | This paper |
| 14 | HIN2Vec | 0.6742
±0.0014 | This paper |
