Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy
Jingyun Zhang, Hao Peng, Jianxin Li, Angsheng Li, Philip S. Yu
Abstract
Unsupervised graph clustering is a fundamental technique for uncovering underlying semantic patterns in large-scale networks. Although Graph Contrastive Learning has demonstrated promising performance, existing methods often suffer from the "structural isolation" issue during mini-batch training, making it challenging to capture cohesive community structures that characterize the global topological distribution. To address these challenges, we propose SCISE , a S calable unsupervised graph C lustering framework that preserves structural Integrity by synergizing community-aware sampling with constrained S tructural E ntropy. Specifically, we first introduce the Structural Entropy Community Constraint operator (SECC), which optimizes structural information within a constrained solution space to mitigate community fragmentation and enhance partition cohesion. Second, to prevent global information loss during batch training, we design a Community-Aware Sampling Expansion (CSampE) mechanism that incorporates the community context of target nodes into sampling batches, effectively breaking structural barriers and preserving topological integrity. Finally, we devise a Structural Contrastive Learning (StructCL) module that refines edge weights based on intra-batch structural similarity, guiding the encoder to learn representations in a higher-order structural space. Extensive experiments on six mainstream benchmark datasets demonstrate that SCISE significantly outperforms state-of-the-art algorithms, with ablation studies and robustness analyses further validating its effectiveness and reliability for real-world large-scale graphs.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9281f695-d99f-4c30-a499-ab39a2f6e05dBuilds on22
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong et al.NeurIPS 2020 · 3,935 citations
- Graph Contrastive Learning with Adaptive AugmentationYanqiao Zhu, Yichen Xu, Feng Yu, Qiang Liu et al.WWW 2021 · 1,415 citations
- Recipe for a General, Powerful, Scalable Graph TransformerLadislav Rampásek, Michael Galkin, Vijay Prakash Dwivedi, Anh Tuan Luu et al.NeurIPS 2022 · 1,216 citations
- GraphSAINT: Graph Sampling Based Inductive Learning MethodHanqing Zeng, Hongkuan Zhou, Ajitesh Srivastava, Rajgopal Kannan et al.ICLR 2020 · 1,155 citations
- Structural Deep Clustering NetworkDeyu Bo, Xiao Wang, Chuan Shi, Meiqi Zhu et al.WWW 2020 · 645 citations
Related papers
- Unsupervised Graph Clustering with Deep Structural EntropyJingyun Zhang, Hao Peng, Li Sun, Guanlin Wu et al.KDD 2025 · 4 citations
- Structural Entropy Guided Unsupervised Graph Out-Of-Distribution DetectionYue Hou, He Zhu, Ruomei Liu, Yingke Su et al.AAAI 2025 · 6 citations
- CL-GCL: Comprehensive and Lightweight Graph Contrastive LearningJianqing Liang, Xinkai Wei, Zhiqiang LiICML 2026
- SEGA: Structural Entropy Guided Anchor View for Graph Contrastive LearningJunran Wu, Xueyuan Chen, Bowen Shi, Shangzhe Li et al.ICML 2023 · 20 citations
- Boosting Graph Contrastive Learning via Graph Contrastive SaliencyChunyu Wei, Yu Wang, Bing Bai, Kai Ni et al.ICML 2023 · 31 citations
