FCAN-MOPSO: An Improved Fuzzy-Based Graph Clustering Algorithm for Complex Networks With Multiobjective Particle Swarm Optimization
Top Cited Papers
- 20 March 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 31 (10) , 3470-3484
Abstract
Performing an accurate clustering analysis is of great significance for us to understand the behavior of complex networks, and a variety of graph clustering algorithms have thus been proposed to do so by taking into account network topology and node attributes. Among them, FCAN is an established fuzzy clustering algorithm that optimizes the memberships of nodes based on dense structures and content relevance. This paper proposes an improved fuzzy-based graph clustering algorithm, namely FCAN-MOPSO, that retains all the benefits associated with FCAN while achieving significantly increased convergence rate using multi-objective particle swarm optimization (MOPSO). To do so, FCAN-MOPSO first modifies the original optimization model of FCAN by adopting an instance-frequency-weighted regularization, which enhances the ability of FCAN-MOPSO to handle the imbalance observed in the distribution of fuzzy memberships of nodes. After that, FCAN-MOPSO decomposes its optimization problem into a set of sub-optimization problems. Following the MOPSO framework, FCAN-MOPSO develops an effective solution to reach a consensus optimization among them by balancing the global exploration and local exploitation abilities of particles. A theoretical analysis is provided to prove the global convergence of FCAN-MOPSO. Extensive experiments have been conducted to evaluate the performance of FCAN-MOPSO on five real-world complex networks with different scale, and experimental results demonstrate that when compared with state-of-the-art clustering algorithms, FCAN-MOPSO achieves a better accuracy performance with improved convergence. Hence, FCAN-MOPSO is a promising graph clustering algorithm to precisely and efficiently discover clusters in complex networks.Keywords
Funding Information
- Natural Science Foundation of Xinjiang Uygur Autonomous Region (2021D01D05)
- National Natural Science Foundation of China (62272078)
- Tianshan Youth Project–Outstanding Youth Science and Technology Talents of Xinjiang (2020Q005)
- CAS Light of the West Multidisciplinary Team project (xbzg-zdsys-202114)
- Pioneer Hundred Talents Program of Chinese Academy of Sciences
This publication has 46 references indexed in Scilit:
- D2MOPSO: MOPSO Based on Decomposition and Dominance with Archiving Using Crowding Distance in Objective and Solution SpacesEvolutionary Computation, 2014
- Structure and dynamics of core/periphery networksJournal of Complex Networks, 2013
- Interactions-based risk clustering methodologies and algorithms for complex project managementInternational Journal of Production Economics, 2013
- Graph clustering based on structural/attribute similaritiesProceedings of the VLDB Endowment, 2009
- Dynamic Graph Clustering Using Minimum-Cut Trees2009
- Multi-Objective Particle Swarm Optimization with time variant inertia and acceleration coefficientsInformation Sciences, 2007
- A tutorial on spectral clusteringStatistics and Computing, 2007
- Graph clusteringComputer Science Review, 2007
- Modularity and community structure in networksProceedings of the National Academy of Sciences, 2006
- Graph Clustering and Minimum Cut TreesInternet Mathematics, 2004