Preventing epidemic spreading in networks by community detection and memetic algorithm

被引:42
作者
Wang, Shanfeng [1 ]
Gong, Maoguo [2 ]
Liu, Wenfeng [2 ]
Wu, Yue [3 ]
机构
[1] Xidian Univ, Sch Cyber Engn, Xian 710071, Shaanxi, Peoples R China
[2] Xidian Univ, Sch Elect Engn, Key Lab Intelligent Percept & Image Understanding, Minist Educ, Xian 710071, Shaanxi, Peoples R China
[3] Xidian Univ, Sch Comp Sci & Technol, Xian 710071, Shaanxi, Peoples R China
基金
中国博士后科学基金; 中国国家自然科学基金;
关键词
Epidemic spreading; Memetic algorithm; Community detection; Epidemic threshold; INFLUENCE MAXIMIZATION; EVOLUTIONARY;
D O I
10.1016/j.asoc.2020.106118
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Targeted immunization is a commonly used strategy in preventing epidemic spreading. Traditional methods immunize targeted nodes based on specific global or local network structures instead of optimization. In this paper, we propose a novel community-based immunization strategy to select targeted immunization nodes based on optimization. The proposed algorithm consists of three steps. First, community structures are discovered by community detection algorithm. Second, possible candidates are narrowed down based on the structure properties of community. Finally, a novel memetic algorithm is designed to select immunization nodes from the candidate set. In the final step, epidemic threshold is adopted as objective function and then targeted immunization is formulated as an optimization problem. To solve this optimization problem, a novel memetic algorithm is designed. Experimental results demonstrate that the proposed algorithm outperforms some state-of-the-art immunization algorithms in optimizing epidemic threshold. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:10
相关论文
共 46 条
[1]  
[Anonymous], KNOWL BASED SYST
[2]  
[Anonymous], QUANT BIOL
[3]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[4]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[5]   Greedy discrete particle swarm optimization for large-scale social network clustering [J].
Cai, Qing ;
Gong, Maoguo ;
Ma, Lijia ;
Ruan, Shasha ;
Yuan, Fuyan ;
Jiao, Licheng .
INFORMATION SCIENCES, 2015, 316 :503-516
[6]   Epidemic thresholds in real networks [J].
Chakrabarti, Deepayan ;
Wang, Yang ;
Wang, Chenxi ;
Leskovec, Jurij ;
Faloutsos, Christos .
ACM TRANSACTIONS ON INFORMATION AND SYSTEM SECURITY, 2008, 10 (04)
[7]   CIM: Community-Based Influence Maximization in Social Networks [J].
Chen, Yi-Cheng ;
Zhu, Wen-Yuan ;
Peng, Wen-Chih ;
Lee, Wang-Chien ;
Lee, Suh-Yin .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2014, 5 (02)
[8]   A local information based multi-objective evolutionary algorithm for community detection in complex networks [J].
Cheng, Fan ;
Cui, Tingting ;
Su, Yansen ;
Niu, Yunyun ;
Zhang, Xingyi .
APPLIED SOFT COMPUTING, 2018, 69 :357-367
[9]   A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms [J].
Derrac, Joaquin ;
Garcia, Salvador ;
Molina, Daniel ;
Herrera, Francisco .
SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) :3-18
[10]   Community detection in complex networks using extremal optimization [J].
Duch, J ;
Arenas, A .
PHYSICAL REVIEW E, 2005, 72 (02)