X-GOAL: Multiplex Heterogeneous Graph Prototypical Contrastive Learning
Baoyu Jing, Shengyu Feng, Yuejia Xiang, Xi Chen, Yu Chen, Hanghang, Tong

TL;DR
X-GOAL introduces a novel contrastive learning framework for multiplex heterogeneous graphs, effectively reducing semantic errors and modeling multiple relation layers to improve node embedding quality without labels.
Contribution
It proposes a multiplex heterogeneous graph prototypical contrastive learning method with layer alignment to enhance unsupervised node embedding learning.
Findings
Outperforms existing methods on real-world datasets
Effectively reduces semantic errors in data augmentation
Successfully models multiplex relations in graphs
Abstract
Graphs are powerful representations for relations among objects, which have attracted plenty of attention. A fundamental challenge for graph learning is how to train an effective Graph Neural Network (GNN) encoder without labels, which are expensive and time consuming to obtain. Contrastive Learning (CL) is one of the most popular paradigms to address this challenge, which trains GNNs by discriminating positive and negative node pairs. Despite the success of recent CL methods, there are still two under-explored problems. First, how to reduce the semantic error introduced by random topology based data augmentations. Traditional CL defines positive and negative node pairs via the node-level topological proximity, which is solely based on the graph topology regardless of the semantic information of node attributes, and thus some semantically similar nodes could be wrongly treated as…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsGraph Neural Network · Contrastive Learning
