Aug 2026· Edelweiss Applied Science and Technology· 0 citations· 23 references
TL;DR
A combined HGT-based framework incorporating contrastive representation learning and deep clustering with multi-round training via pseudo-labels is presented, enabling the model to better deal with label scarcity, heterogeneous dependencies, and overlapping semantics in practical, complex, attributed networks.
Abstract
Identifying communities in heterogeneous attributed graphs remains a significant challenge for networks consisting of multi-membership nodes and multi-relations, attribute-rich information, and very few labels. Here, we present a combined HGT-based framework incorporating contrastive representation learning and deep clustering with multi-round training via pseudo-labels. This enables us to jointly utilize both structural connections and semantic similarities in order to yield more informative node embeddings and discover interesting community structures. Experiments on DBLP and IMDB benchmark datasets demonstrate that the proposed framework is able to achieve competitive performance, verifying its effectiveness for community detection in real-world heterogeneous networks. In addition, the iterative pseudo-labeling mechanism forms a powerful learning strategy that progressively increases supervision by conferring confident predictions on currently unlabeled nodes, while the contrastive and clustering objectives facilitate representation discrimination and community cohesion, enabling our model to better deal with label scarcity, heterogeneous dependencies, and overlapping semantics in practical, complex, attributed networks.
The community detection is a basic task of network analysis, which allows identifying clusters of network nodes with rich internal relationships and structural similarity. The classical community detection algorithms usually assume the network is homogeneous and impose hard assignments of clusters, which restricts thei...
N. Vinod, Neha Priyesh, Sreelakshmy A J et al.· International Conference Com...· 0 citations
A Hypergraph-enhanced graph contrastive learning framework for Graph Out-Of-Distribution detection (termed HGOOD), which constructs two branches to hierarchically mine graph compact semantics in a comprehensive manner and introduces a cross-branch prototype contrast that aligns the captured graph patterns with their cr...
Xuan-Ting Fan, Chen-Yu Wang, Yue-Yue Gao et al.· Proceedings of the Thirty-Fi...· 0 citations
A large-scale, universal, and joint multi-domain heterogeneous graph dataset named UniHG to facilitate heterogeneous graph representation learning and cross-domain knowledge mining and comprehensive benchmark results demonstrate that the model significantly out-performs existing methods with an accuracy improvement of...
Yi-De Qiu, Tong Zhang, Shaoxiang Ling et al.· Neural Information Processin...· 0 citations
Hierarchical Interaction MOdeling for zero-shot generalist GAD enables anomaly detection across diverse graph domains without retraining or access to target-domain supervision by modeling the evolutionary trajectories of node representations across hierarchical structural depths, thereby capturing interaction patterns...
Xiangping Zheng, Xuan Feng, Bo Wu et al.· Proceedings of the 32nd ACM...· 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
LUCID, an LLM-guided, interpretable, training-free, and unsupervised community detection method, designed as a four-stage pipeline that achieves state-of-the-art performance and consistently outperforms leading unsupervised and semi-supervised baselines.
Aoting Zeng, Kai Wang, Jianwei Wang et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.