Multiobjective Complex Network Clustering Based on Dynamical Decomposition Particle Swarm Optimization

Abstract

Clustering is a basic tool applied to complex networks. However, the clustering of complex networks is often based on a single objective function, which can obtain insufficient clustering effects. To address the insufficiencies of single objective complex network clustering, multiobjective complex network clustering was proposed. In this article, to improve multiobjective complex network clustering, we prove the superiority of dynamic decomposition mathematically and propose a parallel discrete particle swarm optimization algorithm based on dynamic decomposition (DDDPSO). First, solutions are obtained at different levels by optimizing the objective functions of parallel subpopulations. Second, the decomposition space is divided dynamically by the reference vector of dynamic decomposition. Particle swarms are used to search for optimal solutions in the partitioned dynamic spaces. Finally, the individuals in the particle swarm are sorted according to the obtained solutions to obtain individuals with good convergence and diversity. We conduct comparisons with many state-of-the-art algorithms on many widely used test datasets to test the DDDPSO. The experimental results show the effectiveness of the proposed approach for complex network clustering.

Keywords

• Multiobjective optimization
• complex network clustering
• discrete particle swarm
• dynamic decomposition