A Consensus Community-Based Spider Wasp Optimization for Dynamic Community Detection

被引:0
作者
Yu, Lin [1 ]
Zhao, Xin [2 ]
Lv, Ming [1 ]
Zhang, Jie [1 ]
机构
[1] Nanjing Univ Sci & Technol, Sch Automat, Xiaolingwei St, Nanjing 210094, Peoples R China
[2] Nanjing Res Inst Elect Engn, Natl Key Lab Informat Syst Engn, Huitong St, Nanjing 210007, Peoples R China
关键词
complex networks; community detection; heuristic algorithm; spider wasp optimization; consensus community; multi-objective optimization; GENETIC ALGORITHM;
D O I
10.3390/math13020265
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
There are many evolving dynamic networks in the real world, and community detection in dynamic networks is crucial in many complex network analysis applications. In this paper, a consensus community-based discrete spider wasp optimization (SWO) approach is proposed for the dynamic network community detection problem. First, the coding, initialization, and updating strategies of the spider wasp optimization algorithm are discretized to adapt to the community detection problem. Second, the concept of intra-population and inter-population consensus community is proposed. Consensus community is the knowledge formed by the swarm summarizing the current state as well as the past history. By maintaining certain inter-population consensus community during the evolutionary process, the population in the current time window can evolve in a similar direction to those in the previous time step. Experimental results on many artificial and real dynamic networks show that the proposed method produces more accurate and robust results than current methods.
引用
收藏
页数:22
相关论文
共 39 条
[1]   Spider wasp optimizer: a novel meta-heuristic optimization algorithm [J].
Abdel-Basset, Mohamed ;
Mohamed, Reda ;
Jameel, Mohammed ;
Abouhawwash, Mohamed .
ARTIFICIAL INTELLIGENCE REVIEW, 2023, 56 (10) :11675-11738
[2]   Identification of network modules by optimization of ratio association [J].
Angelini, L. ;
Boccaletti, S. ;
Marinazzo, D. ;
Pellicoro, M. ;
Stramaglia, S. .
CHAOS, 2007, 17 (02)
[3]  
[Anonymous], 2006, P 12 ACM SIGKDD INT, DOI DOI 10.1145/1150402.1150467
[4]   Size reduction of complex networks preserving modularity [J].
Arenas, A. ;
Duch, J. ;
Fernandez, A. ;
Gomez, S. .
NEW JOURNAL OF PHYSICS, 2007, 9
[5]   Constant Communities in Complex Networks [J].
Chakraborty, Tanmoy ;
Srinivasan, Sriram ;
Ganguly, Niloy ;
Bhowmick, Sanjukta ;
Mukherjee, Animesh .
SCIENTIFIC REPORTS, 2013, 3
[6]   Minimum Manhattan Distance Approach to Multiple Criteria Decision Making in Multiobjective Optimization Problems [J].
Chiu, Wei-Yu ;
Yen, Gary G. ;
Juan, Teng-Kuei .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (06) :972-985
[7]   A Genetic Algorithm (GA) based Load Balancing Strategy for Cloud Computing [J].
Dasgupta, Kousik ;
Mandal, Brototi ;
Dutta, Paramartha ;
Mondal, Jyotsna Kumar ;
Dam, Santanu .
FIRST INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE: MODELING TECHNIQUES AND APPLICATIONS (CIMTA) 2013, 2013, 10 :340-347
[8]   Highly efficient epidemic spreading model based LPA threshold community detection method [J].
Deng, Xiaolong ;
Wen, Ying ;
Chen, Yuanhao .
NEUROCOMPUTING, 2016, 210 :3-12
[9]   An Evolutionary Multiobjective Approach for Community Discovery in Dynamic Networks [J].
Folino, Francesco ;
Pizzuti, Clara .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2014, 26 (08) :1838-1852
[10]   Resolution limit in community detection [J].
Fortunato, Santo ;
Barthelemy, Marc .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2007, 104 (01) :36-41