Str-GCL: Structural Commonsense Driven Graph Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Graph Contrastive Learning (GCL) is a widely adopted approach in self-supervised graph representation learning, applying contrastive objectives to produce effective representations. However, current GCL methods primarily focus on capturing implicit semantic relationships, often overlooking the structural commonsense embedded within the graph's structure and attributes, which contains underlying knowledge crucial for effective representation learning. Due to the lack of explicit information and clear guidance in general graph, identifying and integrating such structural commonsense in GCL poses a significant challenge. To address this gap, we propose a novel framework called Structural Commonsense Unveiling in Graph Contrastive Learning (Str-GCL). Str-GCL leverages first-order logic rules to represent structural commonsense and explicitly integrates them into the GCL framework. It introduces topological and attribute-based rules without altering the original graph and employs a representation alignment mechanism to guide the encoder in effectively capturing this commonsense. To the best of our knowledge, this is the first attempt to directly incorporate structural commonsense into GCL. Extensive experiments demonstrate that Str-GCL outperforms existing GCL methods, providing a new perspective on leveraging structural commonsense in graph representation learning.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 32 of its 52 references that are in the map. First posted on arXiv 9 Jul 2025.
Builds on
32 of 52 references.
References · 32
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2018Graph Neural Networks: A Review of Methods and Applicationscited by 1,576
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2018Deep Graph Infomaxcited by 1,106
- 2018Pitfalls of Graph Neural Network Evaluationcited by 1,007
- 2016Revisiting Semi-Supervised Learning with Graph Embeddingscited by 976
- 2015Image-based Recommendations on Styles and Substitutescited by 706
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
20 more
- 2020A Survey on Knowledge Graphs: Representation, Acquisition and Applicationscited by 643
- 2020Deep Graph Contrastive Representation Learningcited by 539
- 2020Graph Contrastive Learning with Adaptive Augmentationcited by 519
- 2021Graph Self-Supervised Learning: A Surveycited by 289
- 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
- 2014A Tutorial on Principal Component Analysiscited by 141
- 2021From Canonical Correlation Analysis to Self-supervised Graph Neural Networkscited by 141
- 2021Graph Barlow Twins: A self-supervised representation learning framework for graphscited by 85
- 2022Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discriminationcited by 69
- 2022Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminatingcited by 57
- 2024ARC: A Generalist Graph Anomaly Detector with In-Context Learningcited by 48
- 2018Deep Reasoning with Knowledge Graph for Social Relationship Understandingcited by 44
- 2023Towards Self-Interpretable Graph-Level Anomaly Detectioncited by 41
- 2023Simple and Asymmetric Graph Contrastive Learning without Augmentationscited by 38
- 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
- 2023PREM: A Simple Yet Effective Approach for Node-Level Graph Anomaly Detectioncited by 25
- 2023HomoGCL: Rethinking Homophily in Graph Contrastive Learningcited by 18
- 2022Unifying Graph Contrastive Learning with Flexible Contextual Scopescited by 14
- 2023Half-Hop: A graph upsampling approach for slowing down message passingcited by 13
- 2023Rethinking and Simplifying Bootstrapped Graph Latentscited by 10
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.