4.6 Article

Random search immune algorithm for community detection

期刊

SOFT COMPUTING
卷 27, 期 12, 页码 8061-8090

出版社

SPRINGER
DOI: 10.1007/s00500-023-07999-z

关键词

Metaheuristics; Community detection; Immune-inspired algorithms; Random search algorithms; Combinatorial optimization; Complex networks; Modularity optimization

向作者/读者索取更多资源

Community detection, an important research topic in Complex Network Analysis, plays a significant role in interpreting and understanding various systems in neuroscience, biology, social science, and economy. This paper introduces an immune optimization algorithm (opt-IA) for detecting community structures, aiming to maximize the modularity of the identified communities. Compared with 20 heuristics and metaheuristics, opt-IA demonstrates superior performance while being comparable to the Hyper-Heuristic method. The results confirm that opt-IA, despite relying on a purely random process, is reliable and efficient.
Community detection is a prominent research topic in Complex Network Analysis, and it constitutes an important research field on all those areas where complex networks represent a powerful interpretation tool for describing and understanding systems involved in neuroscience, biology, social science, economy, and many others. A challenging approach to uncover the community structure in complex network, and then revealing the internal organization of nodes, is Modularity optimization. In this research paper, we present an immune optimization algorithm (opt-IA) developed to detect community structures, with the main aim to maximize the modularity produced by the discovered communities. In order to assess the performance of opt-IA, we compared it with an overall of 20 heuristics and metaheuristics, among which one Hyper-Heuristic method, using social and biological complex networks as data set. Unlike these algorithms, opt-IA is entirely based on a fully random search process, which in turn is combined with purely stochastic operators. According to the obtained outcomes, opt-IA shows strictly better performances than almost all heuristics and metaheuristics to which it was compared; whilst it turns out to be comparable with the Hyper-Heuristic method. Overall, it can be claimed that opt-IA, even if driven by a purely random process, proves to be reliable and with efficient performance. Furthermore, to prove the latter claim, a sensitivity analysis of the functionality was conducted, using the classic metrics NMI, ARI and NVI.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据