Skip to content
Conference

MACO-MGDT: Overlapping Community Detection in Heterogeneous Networks via Community-Aware Embeddings

Jul 2026 · International Conference Computing Methodologies and Communication · pp. 1657-1663 · 0 citations · 19 references

Abstract

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 their use to real world networks where nodes tend to be a member of more than one cluster and where different types of nodes and attributes are prevalent. To overcome those issues we suggest MACO-MGDT, a single framework of overlapping community detection in non homogenous graphs. The suggested system combines community-conscious representation learning and prototype-based clustering in a two-step architecture. The Multi-scale Attribute-aware Community-Oriented (MACO) module is trained in the first stage to learn structure-aware node embeddings via type-sensitive feature transformations, multi-scale neighborhood aggregation, and community-sensitive attention mechanisms, and a modularity-directed objective is used to incentivize the structure-aware node embeddings to be shaped by latent community structures. The learned embeddings are refined in the second stage by a Multi-scale Graph Diffusion Transformer (MGDT) encoder that incorporates higher-order node interactions. According to the refined representations, a new prototype-based overlapping community detection mechanism is proposed, in which community prototypes can be initially set up by using K-means clustering and soft membership scores are calculated by using similarity-based assignment. The framework is trained with a multi-objective optimization strategy that jointly embeds cohesion, overlap regularization, entropy control, cluster balance, and prototype diversity. The experiments carried out on the heterogeneous citation network of the ACM show that the proposed framework can be used to identify the meaningful community structures. It has high clustering performance of a Silhouette Score of 0.8419, a Davies Bouldin Index of 0.5142 and high graph modularity. The findings also indicate that MACO-MGDT has a very good capability in capturing overlapping community membership especially on the node at an intersectional point. These results demonstrate the promise of the suggested method on scalable and interpretable community detection of complex heterogeneous networks.

View source

Similar papers

Open access Aug 2026

Community-driven network embedding via two-stage community structure refinement

Community structure provides important mesoscopic information for network representation learning, yet most community-aware embedding methods use detected communities as fixed contexts or auxiliary regularizers. This paper proposes CDNE, a Community-Driven Network Embedding framework based on two-stage community structure refinement. In the first stage, CDNE applies the Louvain algorithm to obtain initial community partitions and designs a community-guided random walk strategy to sample both topological neighbors and same-community nodes. The generated sequences are used to learn preliminary node embeddings with the skip-gram model. In the second stage, these preliminary embeddings are clustered to refine community assignments, and the refined communities guide a new round of community-aware embedding learning. Through this design, CDNE incorporates local node proximity and mesoscopic community semantics without relying on an open-ended iterative procedure. Experiments on multiple real-world networks show that CDNE achieves strong performance in link prediction, cross-layer network reconstruction, and community-quality evaluation. Ablation analyses further indicate that meaningful community partitions, community-guided walks, and second-stage refinement jointly contribute to the observed improvements, suggesting that community refinement is an effective strategy for learning discriminative node representations.

Zhikai Chen, Hegui Zhang, Yang Wu et al. · 0 citations
Open access Aug 2026

Hybrid-HGT: A unified deep learning framework for community detection in heterogeneous attributed graphs

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.

Hamza Haddad, Hicham Attariuas, A. Younes · 0 citations
Preprint Jul 2026

Comprehensive, Efficient Large-Scale Community Detection via Structural Entropy Game

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. · 0 citations
Book Open access Jul 2026

One-for-All Community Search on Unseen Graphs

A Spectral-Aware Feature Alignment module to unify feature dimensionality and align cross-domain semantics in a community-aware manner and a Graph Diffusion Tokenized Transformer that constructs hybrid token sequences from local and global structural contexts for Transformer encoding, and applies diffusion-based refinement to mitigate distribution shifts on unseen graphs.

Mo Li, Zhaosong Zhao, Linlin Ding et al. · 0 citations
Preprint Jul 2026

A Novel Gravity-Quasi-Laplacian Approach to Identifying Influential Nodes in Complex Networks

This study introduces a new ranking framework that integrates a quasi-Laplacian structural measure with a gravity-inspired aggregation process and demonstrates that the proposed framework consistently outperforms existing techniques in terms of accuracy, resolution, and computational simplicity.

Shima Esfandiari, S. M. Fakhrahmad · 0 citations