Community Detection Based on Differential Evolution Using Social Spider Optimization

Abstract

Community detection (CD) has become an important research direction for data mining in complex networks. Evolutionary algorithm-based (EA-based) approaches, among many other existing community detection methods, are widely used. However, EA-based approaches are prone to population degradation and local convergence. Developing more efficient evolutionary algorithms thus becomes necessary. In 2013, Cuevas et al. proposed a new differential evolution (DE) hybrid meta-heuristic algorithm based on the simulated cooperative behavior of spiders, known as social spider optimization (SSO). On the basis of improving the SSO algorithm, this paper proposes a community detection algorithm based on differential evolution using social spider optimization (DESSO/CD). In this algorithm, the CD detection process is done by simulating the spider cooperative operators, marriage, and operator selection. The similarity of nodes is defined as local fitness function; the community quality increment is used as a screening criterion for evolutionary operators. Populations are sorted according to their contribution and diversity, making evolution even more different. In the entire process, a random cloud crossover model strategy is used to maintain population diversity. Each generation of the mating radius of the SSO algorithm will be adjusted appropriately according to the iterative times and fitness values. This strategy not only ensures the search space of operators, but also reduces the blindness of exploration. On the other hand, the multi-level, multi-granularity strategy of DESSO/CD can be used to further compensate for resolution limitations and extreme degradation defects based on modular optimization methods. The experimental results demonstrate that the DESSO/CD method could detect the community structure with higher partition accuracy and lower computational cost when compared with existing methods. Since the application of the SSO algorithm in CD research is just beginning, the study is competitive and promising.