解决图聚类中的结构隔离问题,提升大规模网络社区发现效果
Breaking Structural Isolation: Scalable Graph Clustering via Community-Aware Sampling and Structural Entropy

- 用社区感知采样和结构熵约束,防止聚类碎片化
- 在六个基准数据集上超越现有方法,最高提升6.8%
- 适合处理真实大规模复杂网络的无监督聚类任务
无监督图聚类是揭示大规模网络潜在语义模式的基础技术。尽管图对比学习表现优异,但现有方法在小批量训练中常出现'结构隔离'问题,难以捕捉反映全局拓扑分布的紧密社区结构。为此,我们提出SCISE框架,通过社区感知采样与受限结构熵协同,保持结构完整性。首先引入结构熵社区约束算子(SECC),在受限解空间优化结构信息,减少社区分裂并增强划分凝聚力。其次设计社区感知采样扩展机制(CSampE),将目标节点的社区上下文纳入采样批次,有效打破结构壁垒,防止全局信息丢失。最后构建结构对比学习模块(StructCL),基于批内结构相似性调整边权重,引导编码器学习高阶结构空间表示。在六个主流基准数据集上的大量实验表明,SCISE显著优于当前最优算法,消融研究与鲁棒性分析进一步验证其在真实大规模图上的有效性与可靠性。
原文摘要 · Abstract (English)
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 Scalable unsupervised graph Clustering framework that preserves structural Integrity by synergizing community-aware sampling with constrained Structural Entropy. 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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。