Jul 2026· Proceedings of the VLDB Endowment· Vol abs/2607.05469· 0 citations· 54 references
Computer Science
TL;DR
This work proposes SCISE, a unsupervised graph clustering framework that significantly outperforms state-of-the-art algorithms, and designs a Structural Contrastive Learning module that refines edge weights based on intra-batch structural similarity, guiding the encoder to learn representations in higher-order structural space.
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.
Graph Similarity Computation (GSC) is a core task in graph analysis. However, current mainstream GNN-based similarity models still suffer from two fundamental bottlenecks. First, constrained by the inherent mechanism of recursive local aggregation, namely the 1-Weisfeiler–Lehman (1-wl) test, these models primarily measure similarity by aligning local structures, while struggling to capture long-range dependencies and overall topological configurations. Second, the simplified treatment of edge features prevents them from fully exploiting fine-grained semantic interactions between nodes. To address these challenges, this paper pro-poses Structure-Aware Collaborative Network (SAC-Net), an end-to-end framework that leverages structural information to unify global contexts with local affinities. Specifically, we design a Dynamic Structural Perception (DSP) backbone to establish a joint evolution paradigm for node, position, and edge features. By treating positional encodings as dynamic states, the model effectively captures long-range dependencies and overall topological configurations to maintain a robust global structural skeleton. Subsequently, this study introduce an Edge-Aware Fusion mechanism that leverages edge features as a bridge to adaptively integrate global and local structural information, thereby effectively addressing the alignment and integration of multi-granularity semantics. Extensive experiments on four real-world datasets demonstrate that SAC-Net effectively integrates global and local information, leading to more accurate graph similarity measurement.
Unknown authors· Tsinghua Science and Technol...· 0 citations
A novel heuristic community detection algorithm, termed CoDeSEG, which identifies communities by minimizing the network's two-dimensional structural entropy within a potential game framework, and introduces a structural entropy-based node overlapping heuristic for detecting overlapping communities, with a near-linear time complexity.
Pu Li, Yantuan Xian, Hao Peng et al.· arXiv.org· 0 citations
DiffGCC is a generative graph contrastive clustering framework that couples global–local feature encoding with a latent-space diffusion denoising mechanism and substantially outperforms existing methods across ACC, NMI, ARI, and F1, with particularly strong gains on denser, noisier product graphs.
Lun Liu, Chengyun Song· Pattern Analysis and Applica...· 0 citations
This framework introduces a dual-encoder architecture that separately processes structural and attribute information, incorporates node positional encoding to approximate Neighborhood Identity Distribution (NID), and employs dual reconstruction tasks for both edges and node attributes.
SimGAT, a structure-aware graph attention model built on SimRank-derived structural embeddings, is proposed, which computes structural similarity in the SimRank2Vec embedding space and injects it as a topological prior into the graph attention mechanism, enabling neighborhood aggregation to be jointly guided by node attributes and global structural relationships.
Chengda Xu, Yinglong Zhang· Journal of King Saud Univers...· 0 citations
Through this design, CDNE incorporates local node proximity and mesoscopic community semantics without relying on an open-ended iterative procedure, and achieves strong performance in link prediction, cross-layer network reconstruction, and community-quality evaluation.
Zhikai Chen, He-Gui Zhang, Yang Wu et al.· Scientific Reports· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.