Hybrid-Collaborative Augmentation and Contrastive Sample Adaptive-Differential Awareness for Robust Attributed Graph Clustering
Not on the map. Why?
Abstract (arXiv)
Due to its powerful capability of self-supervised representation learning and clustering, contrastive attributed graph clustering (CAGC) has achieved great success, which mainly depends on effective data augmentation and contrastive objective setting. However, most CAGC methods utilize edges as auxiliary information to obtain node-level embedding representation and only focus on node-level embedding augmentation. This approach overlooks edge-level embedding augmentation and the interactions between node-level and edge-level embedding augmentations across various granularity. Moreover, they often treat all contrastive sample pairs equally, neglecting the significant differences between hard and easy positive-negative sample pairs, which ultimately limits their discriminative capability. To tackle these issues, a novel robust attributed graph clustering (RAGC), incorporating hybrid-collaborative augmentation (HCA) and contrastive sample adaptive-differential awareness (CSADA), is proposed. First, node-level and edge-level embedding representations and augmentations are simultaneously executed to establish a more comprehensive similarity measurement criterion for subsequent contrastive learning. In turn, the discriminative similarity further consciously guides edge augmentation. Second, by leveraging pseudo-label information with high confidence, a CSADA strategy is elaborately designed, which adaptively identifies all contrastive sample pairs and differentially treats them by an innovative weight modulation function. The HCA and CSADA modules mutually reinforce each other in a beneficent cycle, thereby enhancing discriminability in representation learning. Comprehensive graph clustering evaluations over six benchmark datasets demonstrate the effectiveness of the proposed RAGC against several state-of-the-art CAGC methods.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 25 of its 45 references that are in the map. First posted on arXiv 3 Oct 2025.
Builds on
25 of 45 references.
References · 25
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2017Graph Attention Networkscited by 8,923
- 2016Variational Graph Auto-Encoderscited by 1,382
- 2020Contrastive Multi-View Representation Learning on Graphscited by 652
- 2019Attributed Graph Clustering: A Deep Attentional Embedding Approachcited by 149
- 2020Structural Deep Clustering Networkcited by 145
- 2022A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodalcited by 106
- 2021Deep Graph Clustering via Dual Correlation Reductioncited by 97
- 2020Adaptive Graph Encoder for Attributed Graph Embeddingcited by 89
- 2021ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learningcited by 72
- 2020Deep Fusion Clustering Networkcited by 71
- 2022A Survey on Graph Representation Learning Methodscited by 66
13 more
- 2022Hard Sample Aware Network for Contrastive Deep Graph Clusteringcited by 61
- 2023Cluster-guided Contrastive Graph Clustering Networkcited by 60
- 2022Simple Contrastive Graph Clusteringcited by 56
- 2022A Survey of Deep Graph Clustering: Taxonomy, Challenge, Application, and Open Resourcecited by 26
- 2023Neighbor Contrastive Learning on Learnable Graph Augmentationcited by 25
- 2023CONVERT:Contrastive Graph Clustering with Reliable Augmentationcited by 23
- 2021Self-supervised Contrastive Attributed Graph Clusteringcited by 18
- 2022GraphLearner: Graph Node Clustering with Fully Learnable Augmentationcited by 10
- 2023Affinity Uncertainty-based Hard Negative Mining in Graph Contrastive Learningcited by 9
- 2023AGNN: Alternating Graph-Regularized Neural Networks to Alleviate Over-Smoothingcited by 7
- 2023Decouple Graph Neural Networks: Train Multiple Simple GNNs Simultaneously Instead of Onecited by 7
- 2024DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representationscited by 3
- 2025A Survey of Large Language Models for Data Challenges in Graphscited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.