Features Based Adaptive Augmentation for Graph Contrastive Learning
Self-Supervised learning aims to eliminate the need for expensive annotation in graph representation learning, where graph contrastive learning (GCL) is trained with the self-supervision signals containing data-data pairs. These data-data pairs are generated with augmentation employing stochastic functions on the original graph. We argue that some features can be more critical than others depending on the downstream task, and applying stochastic function uniformly, will vandalize the influential features, leading to diminished accuracy. To fix this issue, we introduce a Feature Based Adaptive Augmentation (FebAA) approach, which identifies and preserves potentially influential features and corrupts the remaining ones. We implement FebAA as plug and play layer and use it with state-of-the-art Deep Graph Contrastive Learning (GRACE) and Bootstrapped Graph Latents (BGRL). We successfully improved the accuracy of GRACE and BGRL on eight graph representation learning's benchmark datasets.
Code (1)
Tasks
Contrastive LearningGraph Representation LearningRepresentation LearningSelf-Supervised LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Graph Contrastive Learning with Adaptive Augmentation
Recently, contrastive learning (CL) has emerged as a successful method for unsupervised graph representation learning. Most graph CL methods first perform stochastic augmentation on the input graph to obtain two graph vi…
AttributeContrastive LearningData AugmentationGraph Representation Learning+2Contrastive General Graph Matching with Adaptive Augmentation Sampling
Graph matching has important applications in pattern recognition and beyond. Current approaches predominantly adopt supervised learning, demanding extensive labeled data which can be limited or costly. Meanwhile, self-su…
Contrastive LearningGraph MatchingSelf-Supervised LearningTemporal Graph Representation Learning with Adaptive Augmentation Contrastive
Temporal graph representation learning aims to generate low-dimensional dynamic node embeddings to capture temporal information as well as structural and property information. Current representation learning methods for …
Contrastive LearningGraph Representation LearningRepresentation LearningPropagation Tree Is Not Deep: Adaptive Graph Contrastive Learning Approach for Rumor Detection
Rumor detection on social media has become increasingly important. Most existing graph-based models presume rumor propagation trees (RPTs) have deep structures and learn sequential stance features along branches. However…
Contrastive LearningMulti-Task Curriculum Graph Contrastive Learning with Clustering Entropy Guidance
Recent advances in unsupervised deep graph clustering have been significantly promoted by contrastive learning. Despite the strides, most graph contrastive learning models face challenges: 1) graph augmentation is used t…
ClusteringContrastive LearningDiversityGraph Clustering