Sign inGet started
Paper · arXiv

Robust Contrastive Graph Clustering with Adaptive Local-Global Integration

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 mecha...

AuthorsLei Zhang, Fubo Sun, Haipeng Yang et al.
Primary categorycs.LG
Published27 May 2026
Last updated at source30 May 2026
cs.LG
Embed this entry
<iframe src="https://silytics.si/embed/item/f144e77e-5b20-428a-84cf-9a040ff3eee8" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.