CCLPA: A clustering coefficient based label propagation algorithm for unfolding communities in complex networks

Raju, E.; Ramadevi, Y.; Sravanthi, K.

doi:10.1109/cesys.2017.8321273

Cited by 2 publications

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We compare our algorithm with seven similar algorithms: GA-net [14], MOEA/D-net [43], MOCD [17], MOGA-net [16], Informap [44], MOPSO-r2 [45], LMOEA [20] and CCLPA [46]. proposed the GA-net algorithm.…”

Section: Experimental Studies a Compared Algorithmsmentioning

confidence: 99%

Multiobjective Complex Network Clustering Based on Dynamical Decomposition Particle Swarm Optimization

2020

View full text Add to dashboard Cite

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. INDEX TERMS Multiobjective optimization, complex network clustering, discrete particle swarm, dynamic decomposition.

show abstract