.png){kind=icon}
.png){kind=icon}
Return
Unsupervised Multimodal Community Detection Algorithm in Complex Network Based on Fractal Iteration
.png){kind=icon}
PRE
AI
DOI：10.3390-fractalfract9080507.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Community detection in complex networks plays a pivotal role in modern scientific research, including in social network analysis and protein structure analysis. Traditional community detection methods face challenges in integrating heterogeneous multi-source information, capturing global semantic relationships, and adapting to dynamic network evolution. This paper proposes a novel unsupervised multimodal community detection algorithm (UMM) based on fractal iteration. The core idea is to design a dual-channel encoder that comprehensively considers node semantic features and network topological structures. Initially, node representation vectors are derived from structural information (using feature vectors when available, or singular value decomposition to obtain feature vectors for nodes without attributes). Subsequently, a parameter-free graph convolutional encoder (PFGC) is developed based on fractal iteration principles to extract high-order semantic representations from structural encodings without requiring any training process. Furthermore, a semantic–structural dual-channel encoder (DC-SSE) is designed, which integrates semantic encodings—reduced in dimensionality via UMAP—with structural features extracted by PFGC to obtain the final node embeddings. These embeddings are then clustered using the K-means algorithm to achieve community partitioning. Experimental results demonstrate that the UMM outperforms existing methods on multiple real-world network datasets.
Keywords:
community detection
multimodal learning
fractal iteration
node embedding
graph convolution
Journal
IF:
3.3
Papers:
4.3K
Citations:
7.6K