Dual space graph contrastive learning

Haoran YANG, Hongxu CHEN, Shirui PAN, Lin LI, Philip S. YU, Guandong XU

Research output: Chapter in Book/Report/Conference proceedingChapters

33 Citations (Scopus)

Abstract

Unsupervised graph representation learning has emerged as a powerful tool to address real-world problems and achieves huge success in the graph learning domain. Graph contrastive learning is one of the unsupervised graph representation learning methods, which recently attracts attention from researchers and has achieved state-of-the-art performances on various tasks. The key to the success of graph contrastive learning is to construct proper contrasting pairs to acquire the underlying structural semantics of the graph. However, this key part is not fully explored currently, most of the ways generating contrasting pairs focus on augmenting or perturbating graph structures to obtain different views of the input graph. But such strategies could degrade the performances via adding noise into the graph, which may narrow down the field of the applications of graph contrastive learning. In this paper, we propose a novel graph contrastive learning method, namely Dual Space Graph Contrastive (DSGC) Learning, to conduct graph contrastive learning among views generated in different spaces including the hyperbolic space and the Euclidean space. Since both spaces have their own advantages to represent graph data in the embedding spaces, we hope to utilize graph contrastive learning to bridge the spaces and leverage advantages from both sides. The comparison experiment results show that DSGC achieves competitive or better performances among all the datasets. In addition, we conduct extensive experiments to analyze the impact of different graph encoders on DSGC, giving insights about how to better leverage the advantages of contrastive learning between different spaces. Copyright © 2022 Association for Computing Machinery.

Original languageEnglish
Title of host publicationProceedings of the ACM Web Conference 2022
Place of PublicationNew York
PublisherAssociation for Computing Machinery
Pages1238-1247
ISBN (Electronic)9781450390965
DOIs
Publication statusPublished - Apr 2022

Citation

Yang, H., Chen, H., Pan, S., Li, L., Yu, P. S., & Xu, G. (2022). Dual space graph contrastive learning. In Proceedings of the ACM Web Conference 2022 (pp. 1238-1247). Association for Computing Machinery. https://doi.org/10.1145/3485447.3512211

Keywords

  • Graph contrastive learning
  • Hyperbolic space
  • Graph embedding

Fingerprint

Dive into the research topics of 'Dual space graph contrastive learning'. Together they form a unique fingerprint.