HeterGCL: Graph Contrastive Learning Framework on Heterophilic Graph

HeterGCL: Graph Contrastive Learning Framework on Heterophilic Graph

Chenhao Wang, Yong Liu, Yan Yang, Wei Li

Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence
Main Track. Pages 2397-2405. https://doi.org/10.24963/ijcai.2024/265

Graph Contrastive Learning (GCL) has attracted significant research attention due to its self-supervised ability to learn robust node representations. Unfortunately, most methods primarily focus on homophilic graphs, rendering them less effective for heterophilic graphs. In addition, the complexity of node interactions in heterophilic graphs poses considerable challenges to augmentation schemes, coding architectures, and contrastive designs for traditional GCL. In this work, we propose HeterGCL, a novel graph contrastive learning framework with structural and semantic learning to explore the true potential of GCL on heterophilic graphs. Specifically, We abandon the random augmentation scheme that leads to the destruction of the graph structure, instead introduce an adaptive neighbor aggregation strategy (ANA) to extract topology-supervised signals from neighboring nodes at different distances and explore the structural information with an adaptive local-to-global contrastive loss. In the semantic learning module, we jointly consider the original nodes' features and the similarity between nodes in the latent feature space to explore hidden associations between nodes. Experimental results on homophilic and heterophilic graphs demonstrate that HeterGCL outperforms existing self-supervised and semi-supervised baselines across various downstream tasks.
Keywords:
Data Mining: DM: Mining graphs
Machine Learning: ML: Self-supervised Learning