Research on a Multilayer Network Community Detection Algorithm Based on Local Information Expansion

Multilayer networks, as an important branch of network science, have become a powerful tool for revealing and analyzing the internal structures of complex systems. Within these networks, community detection is particularly crucial, as it assists in uncovering hidden patterns within the network. We c...

Full description

Saved in:
Bibliographic Details
Published in:Big Data Mining and Analytics Vol. 8; no. 6; pp. 1282 - 1306
Main Authors: Li, Xiaoming, Xiong, Neal N., Yu, Wei, Chen, Long, Bai, Hongpeng, Jin, Hongwei
Format: Journal Article
Language:English
Published: Tsinghua University Press 01.12.2025
Subjects:
algorithm efficiency
community detection
local information expansion strategy
multilayer network
structural hierarchy
ISSN:2096-0654, 2097-406X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Multilayer networks, as an important branch of network science, have become a powerful tool for revealing and analyzing the internal structures of complex systems. Within these networks, community detection is particularly crucial, as it assists in uncovering hidden patterns within the network. We construct a seed node selection method based on the local structural characteristics of network nodes and, by integrating deep learning methods, establish a local information expansion strategy. This approach effectively identifies and expands community boundaries, developing a novel multilayer network community detection algorithm—the Layered Information Expansion Detection Algorithm (LIEDA). Its exceptional performance has been experimentally verified using multiple real-world datasets. Compared with existing technologies, the LIEDA has considerable accuracy, stability, and adaptability advantages. Compared with various popular benchmark algorithms, the model has substantially improved multiple evaluation metrics across several authoritative public and synthetic datasets.
ISSN:2096-0654
2097-406X
DOI:10.26599/BDMA.2025.9020023