arXiv:2605.28209cs.LG2026-05中稿 · IJCAI

通过自适应融合局部与全局信息,提升复杂图的聚类效果。

Robust Contrastive Graph Clustering with Adaptive Local-Global Integration

论文配图:Robust Contrastive Graph Clustering with Adaptive Local-Global Integration
图 1 · 摘自论文原文
  • 用注意力机制动态融合多尺度局部结构特征
  • 基于动态聚类中心构建语义原型增强全局区分度
  • 在8个真实数据集上表现优于现有方法,适合复杂图分析

图聚类在揭示结构模式和节点社区方面至关重要。尽管自监督对比学习已通过结构和属性信号提升聚类性能,但现有方法仍难以灵活捕捉高阶局部结构,常忽略复杂图中的全局语义。为此,提出一种对比图聚类框架,通过注意力机制联合集成多尺度局部结构与全局语义。局部层面,利用GNN从多传播深度提取拓扑信号,并通过注意力加权自适应融合以捕捉多尺度邻域特征;全局层面,基于动态演化的聚类中心生成语义原型,经注意力聚合引导节点表示并增强类间可分性。模型采用双视图对比学习范式,结合实例级与结构感知损失的混合目标进行训练,提升表征鲁棒性与判别力。在8个真实世界图数据集上的实验表明,该方法实现了具有竞争力的聚类性能。代码已公开于 https://github.com/vege12138/w2。

原文摘要 · Abstract (English)

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 attribute signals, existing methods still struggle to flexibly capture high-order local structures and often overlook global semantics in complex graphs. These limitations lead to suboptimal node representations, especially in real-world graphs with fragmented structures and ambiguous cluster boundaries. To address these limitations, a contrastive graph clustering framework is proposed to jointly integrate multi-scale local structures with global semantics via attention mechanisms. At the local level, GNN-based topological signals extracted from multiple propagation depths are adaptively fused through attention-based weighting to capture multi-scale neighborhood features. At the global level, semantic prototypes derived from dynamically evolving cluster centers are adaptively aggregated through attention to guide node representations and enhance inter-cluster separability. The model is trained under a dual-view contrastive learning paradigm with a hybrid objective that combines instance-level and structure-aware losses to improve representation robustness and discrimination. Experiments on eight real-world graph datasets demonstrate that our method achieves competitive clustering performance. Code is available at https://github.com/vege12138/w2.

图聚类对比学习注意力机制多尺度特征

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。