arrow
Return

Improving Augmentation Consistency for Graph Contrastive Learning

delete2024-04-01
delete4
PRE
AI
X
Xiaofeng Cao *
Y
Yizhen Zheng
S
Shirui Pan
DOI:10.1016/j.patcog.2023.110182delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Graph contrastive learning (GCL) enhances unsupervised graph representation by generating different con-trastive views, in which properties of augmented nodes are required to be aligned with their anchors. However, we find that in some existing GCL methods, it is hard to inherit semantic and structural properties of graphs from anchor views due to inconsistent augmentation schemes, which may hurt node consistency in augmented views. In this paper, we present ConGCL to improve node consistency and enhance node classification. Specifically, we first consider context entailment, which integrates the semantic and structural properties to better mine the underlying consistency relationships of nodes. Beneficial from this, we then design a novel consistency improvement loss to maintain augmentation consistency agreement among positive node pairs under stochastic augmentation schemes. To investigate the effectiveness of ConGCL on improving augmentation consistency and enhancing node classification, we conduct empirical study and extensive experiments on benchmark datasets. The code is available at: https://github.com/brysonwx/ConGCL.
Keywords:
Graph contrastive learning
Augmentation consistency

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

M
Monash University
Scholars:
5.4W
Papers: 5.4W
Citations: 79
G
Griffith University
Scholars:
1.5W
Papers: 1.6W
Citations: 2.5W
J
Jilin University
Scholars:
8.6W
Papers: 5.5W
Citations: 8.9K
researcher View more organizations