Saved in:
Bibliographic Details
Main Authors: Zhang, Lei, Sun, Fubo, Yang, Haipeng, Guan, Zhong, Wu, Likang
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2605.28209
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866917549097091072
author Zhang, Lei
Sun, Fubo
Yang, Haipeng
Guan, Zhong
Wu, Likang
author_facet Zhang, Lei
Sun, Fubo
Yang, Haipeng
Guan, Zhong
Wu, Likang
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2605_28209
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Robust Contrastive Graph Clustering with Adaptive Local-Global Integration
Zhang, Lei
Sun, Fubo
Yang, Haipeng
Guan, Zhong
Wu, Likang
Machine Learning
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.
title Robust Contrastive Graph Clustering with Adaptive Local-Global Integration
topic Machine Learning
url https://arxiv.org/abs/2605.28209