Self-Supervised Contrastive Graph Clustering Network via Structural Information Fusion
Graph clustering, a classical task in graph learning, involves partitioning the nodes of a graph into distinct clusters. This task has applications in various real-world scenarios, such as anomaly detection, social network analysis, and community discovery. Current graph clustering methods commonly rely on module pre-training to obtain a reliable prior distribution for the model, which is then used as the optimization objective. However, these methods often overlook deeper supervised signals, leading to sub-optimal reliability of the prior distribution. To address this issue, we propose a novel deep graph clustering method called CGCN. Our approach introduces contrastive signals and deep structural information into the pre-training process. Specifically, CGCN utilizes a contrastive learning mechanism to foster information interoperability among multiple modules and allows the model to adaptively adjust the degree of information aggregation for different order structures. Our CGCN method has been experimentally validated on multiple real-world graph datasets, showcasing its ability to boost the dependability of prior clustering distributions acquired through pre-training. As a result, we observed notable enhancements in the performance of the model.
Code (0)
등록된 구현이 없습니다.
Tasks
Anomaly DetectionClusteringContrastive LearningGraph ClusteringGraph LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
SLCGC: A lightweight Self-supervised Low-pass Contrastive Graph Clustering Network for Hyperspectral Images
Self-supervised hyperspectral image (HSI) clustering remains a fundamental yet challenging task due to the absence of labeled data and the inherent complexity of spatial-spectral interactions. While recent advancements h…
ClusteringComputational EfficiencyContrastive LearningDenoising+1SCGC : Self-Supervised Contrastive Graph Clustering
Graph clustering discovers groups or communities within networks. Deep learning methods such as autoencoders (AE) extract effective clustering and downstream representations but cannot incorporate rich structural informa…
ClusteringGraph ClusteringSelf-supervised Contrastive Attributed Graph Clustering
Attributed graph clustering, which learns node representation from node attribute and topological graph for clustering, is a fundamental but challenging task for graph analysis. Recently, methods based on graph contrasti…
AttributeClusteringContrastive LearningGraph Clustering+1Robust Contrastive Graph Clustering with Adaptive Local-Global Integration
Graph clustering is essential in graph analysis for revealing structural patterns and node communities. Despite recent advances in self-supervised contrastive learning that have improved clustering via structural and att…
Contrastive LearningGraph ClusteringAdaptive Self-supervised Robust Clustering for Unstructured Data with Unknown Cluster Number
We introduce a novel self-supervised deep clustering approach tailored for unstructured data without requiring prior knowledge of the number of clusters, termed Adaptive Self-supervised Robust Clustering (ASRC). In parti…
ClusteringContrastive LearningDeep Clustering