Dynamic Community Detection Based on a Label-Based Swarm Intelligence

Abstract

The dynamic network tails after the development of the real-world that is essential for particle applications such as traffic flow analyses and social network analyses. The requirement of maximizing the quality of the community structure at current time step and minimizing the difference of the community structure between two successive time steps synchronously brings serious challenges to the dynamic community detection. Some existing approaches (i.e., the multi-objective particle swarm optimization, named as DYNMOPSO) utilize the swarm intelligence pattern to solve such a community detection problem in dynamic networks. Nevertheless, the DYNMOPSO has the deficiency of the undesirable prematurity constringency and monotonicity of particles because of the high choice stress. Thus, a label-based swarm intelligence on the basis of the evolutionary clustering framework is presented for overcoming those disadvantages. The label propagation approach initializes the labels of particles and is used for escaping the prematurity constringency. The crossover and mutation methods are introduced to improve the variety of particles and retain preferable the community structure synchronously. Experiments in synthetical and real networks prove that our algorithm is valid and exceeds state-of-the-art approaches.

How to Optimize the Supply and Allocation of Medical Emergency Resources During Public Health Emergencies

“…The overview of GA-PSO is shown in Figure 1. It adopts one-way crossover and mutation operations to modify MODPSO in order to enhance the quality of solutions and escape the local optimum [19,20]. Every population is composed of a set of particles which is a feasible solution (i.e., X).…”

Tracing the spatial‐temporal evolution dynamics of air traffic systems using graph theories

“…A graph is a straightforward way for modeling complex networks and networked systems. [23][24][25][26][27] A graph is composed of nodes or vertices and edges. Generally, a graph is denoted by…”

Label entropy‐based cooperative particle swarm optimization algorithm for dynamic overlapping community detection in complex networks

“…DYNMOPSO could lead to premature convergence and poor monotonicity of particles. L-DMGAPSO 19 algorithm overcomes the shortcomings of DYNMOPSO through introducing the label swarm intelligent algorithm based on the evolutionary clustering framework. It initialized particle swarm with the label propagation method which solved the situation of premature convergence, and adopted the crossover and mutation operator to maintain the particle diversity.…”

“…[14][15][16] In addition, according to whether the network structure changes or not over time, the community detection algorithms can be divided into static community detection 16,17 and dynamic community detection. 18,19 Since the real-world complex networks are usually dynamical with time going on, it is of great practical significance to research dynamic community detection. To store the dynamic data in continuously changing dynamic networks, network snapshots which represent the multiple static network replicas at different time points should be stored continuously.…”