arrow
返回

Multi-objective memetic algorithm for core-periphery structure detection in complex network

delete2021-07-28
delete6
PRE
AI
郭丽 (Guo Li)
朱泽轩 封面图
朱泽轩 (Zexuan Zhu) *
L
Lijia Ma *
马晓亮 (Xiaoliang Ma)
DOI:10.1007/s12293-021-00342-9delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Core-periphery structure detection (CPSD) in complex networks is essential to reveal functional nodes in the complicated systems, e.g., influential nodes in a social network and central cells in a biological network. Some progress has been made in solving the CPSD problem with heuristic algorithms. However, CPSD is naturally an NP-hard optimization problem and the core-periphery structures (CPSs) in real networks usually are not clearly distinguishable. The majority of the existing CPSD methods are single-objective methods relying on some assumptions, preference, and/or prior knowledge. They can provide only one trade-off solution that is inevitably biased and lacks of flexibility in terms of resolution. To address this issue, this paper formulates the CPSD problem as a multi-objective optimization problem (MOP), i.e., minimizing the core-node size and maximizing the core-node capacity of the CPSs, simultaneously. Solving the MOP can provide more accurate CPSs and allow one to explore the network structure at different preferred resolutions. A multi-objective memetic algorithm (called MOMA-PCLS) is accordingly proposed to solve the formulated problem. A new plateau-climbing local search (PCLS) method incorporating the information of the heavy-tailed distribution of the node capacity is introduced to fine-tune the individual solutions in MOMA-PCLS. By combining the evolutionary operations and PCLS, MOMA-PCLS manages to improve the search efficiency significantly. Experimental results on both synthetic and real-world data show the superiority of MOMA-PCLS to other state-of-the-art algorithms in detecting CPSs of complex networks.
Keyword:
Core-periphery structure
Multi-objective optimization
Memetic algorithm
Complex networks
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Memetic Computing 封面图
Memetic Computing
IF:
2.3
论文数:
453
被引数:
718

机构

S
shenzhen university
学者数:
4.5W
论文数: 3.4W
被引数: 72