.png){kind=icon}
返回
An efficient algorithm for community detection in complex weighted networks
.png){kind=icon}
OA
AI
DOI：10.1002/aic.17205.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Community detection decomposes large-scale, complex networks optimally into sets of smaller sub-networks. It finds sub-networks that have the least inter-connections and the most intra-connections. This article presents an efficient community detection algorithm that detects community structures in a weighted network by solving a multi-objective optimization problem. The whale optimization algorithm is extended to enable it to handle multi-objective optimization problems with discrete variables and to solve the problems on parallel processors. To this end, the population's positions are discretized using a transfer function that maps real variables to discrete variables, the initialization steps for the algorithm are modified to prevent generating unrealistic connections between variables, and the updating step of the algorithm is redefined to produce integer numbers. To identify the community configurations that are Pareto optimal, the non-dominated sorting concept is adopted. The proposed algorithm is tested on the Tennessee Eastman process and several benchmark community-detection problems.
Keyword:
community detection
complex network
multi‐ objective optimization
whale optimization algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
1.1W
被引数:
2.9W
机构
引用论文
分享收藏Satisfied and fair two-sided matching method considering dual-reference with linguistic preference
PREAI
分享收藏Assessing simultaneous immobilization of lead and improvement of phosphorus availability through application of phosphorus-rich biochar in a contaminated soil: A pot experiment.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏
分享收藏
查看更多内容