mlsanityData to 7 Oct 2026

Heterogeneous Graph Contrastive Multi-view Learning

arXiv 2210.00248 ↗First posted 1 Oct 2022cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 32 of its 41 references that are in the map. First posted on arXiv 1 Oct 2022.

Builds on

32 of 41 references.

References · 32

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 11,979
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2019Momentum Contrast for Unsupervised Visual Representation Learningcited by 7,482
  5. 2017Inductive Representation Learning on Large Graphscited by 6,284
  6. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,712
  7. 2017Neural Message Passing for Quantum Chemistrycited by 3,460
  8. 2019A Comprehensive Survey on Graph Neural Networkscited by 2,906
  9. 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,838
  10. 2017Modeling Relational Data with Graph Convolutional Networkscited by 1,684
  11. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  12. 2020Graph Contrastive Learning with Augmentationscited by 1,203
20 more
  1. 2018Deep Graph Infomaxcited by 1,101
  2. 2020What Makes for Good Views for Contrastive Learning?cited by 843
  3. 2019Heterogeneous Graph Attention Networkcited by 732
  4. 2020Contrastive Multi-View Representation Learning on Graphscited by 651
  5. 2020Heterogeneous Graph Transformercited by 581
  6. 2020Deep Graph Contrastive Representation Learningcited by 535
  7. 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
  8. 2019Diffusion Improves Graph Learningcited by 414
  9. 2020Hard Negative Mixing for Contrastive Learningcited by 399
  10. 2020Debiased Contrastive Learningcited by 354
  11. 2020MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embeddingcited by 304
  12. 2021Large-Scale Representation Learning on Graphs via Bootstrappingcited by 184
  13. 2017Heterogeneous Information Network Embedding for Recommendationcited by 133
  14. 2021Self-supervised Heterogeneous Graph Neural Network with Co-contrastive Learningcited by 130
  15. 2021An Empirical Study of Graph Contrastive Learningcited by 113
  16. 2015PTE: Predictive Text Embedding through Large-scale Heterogeneous Text Networkscited by 96
  17. 2019Unsupervised Attributed Multiplex Network Embeddingcited by 95
  18. 2021HDMI: High-order Deep Multiplex Infomaxcited by 82
  19. 2021ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learningcited by 72
  20. 2019Heterogeneous Deep Graph Infomaxcited by 42

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 5; 2025: 5; 2026: 2.

14 papers.

Sort: