Cluster-Perceptive Graph Contrastive Learning for Community Detection

Communities, revealing tightly-knit groups within networks, are essential to complex network analysis. While contrastive learning has been widely applied to community detection, existing studies often overlook latent community assignments information when constructing negative samples, resulting in many potential false negatives. To overcome this limitation, we propose Cluster-Perceptive Graph Contrastive Learning (CPGCL), which integrates the collaborative learning of intermediate representations and community assignments. Our approach utilizes a shared-parameter encoder to generate intermediate representations from two views. These representations are used to derive community probability distributions, which guide model training through contrastive loss between communities. Then by leveraging the generated sample community probability distributions to dynamically reweight the intermediate representations of sample pairs for contrastive learning, we mitigate the issue of potential false negatives and promote more discriminative intermediate representations. Additionally, high-confidence community assignments are used to iteratively refine the intermediate representations, further enhancing community detection performance. Experiments on three benchmark datasets validate the effectiveness and superiority of our approach. Code is available at https://github.com/l1tok/CPGCL.git.

Authors

Institutions

Publication Details

Published
2025-03-12
DOI
https://doi.org/10.1109/icassp49660.2025.10889718
Citations
3
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
7.44

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Cluster-Perceptive Graph Contrastive Learning for Community Detection

Fanyu Han, Wei Wang, Hongbin Li
3 citations
Text and Document Classification Technologies
7.44
article

Cluster-Perceptive Graph Contrastive Learning for Community Detection

Fanyu Han, Wei Wang, Hongbin Li
article en
3 citations

Abstract

Communities, revealing tightly-knit groups within networks, are essential to complex network analysis. While contrastive learning has been widely applied to community detection, existing studies often overlook latent community assignments information when constructing negative samples, resulting in many potential false negatives. To overcome this limitation, we propose Cluster-Perceptive Graph Contrastive Learning (CPGCL), which integrates the collaborative learning of intermediate representations and community assignments. Our approach utilizes a shared-parameter encoder to generate intermediate representations from two views. These representations are used to derive community probability distributions, which guide model training through contrastive loss between communities. Then by leveraging the generated sample community probability distributions to dynamically reweight the intermediate representations of sample pairs for contrastive learning, we mitigate the issue of potential false negatives and promote more discriminative intermediate representations. Additionally, high-confidence community assignments are used to iteratively refine the intermediate representations, further enhancing community detection performance. Experiments on three benchmark datasets validate the effectiveness and superiority of our approach. Code is available at https://github.com/l1tok/CPGCL.git.

East China Normal University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 4%
Text and Document Classification Technologies
7.44
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.