Improved multi-objective clustering algorithm using particle swarm optimization

32Citations
Citations of this article
32Readers
Mendeley users who have this article in their library.

Abstract

Multi-objective clustering has received widespread attention recently, as it can obtain more accurate and reasonable solution. In this paper, an improved multi-objective clustering framework using particle swarm optimization (IMCPSO) is proposed. Firstly, a novel particle representation for clustering problem is designed to help PSO search clustering solutions in continuous space. Secondly, the distribution of Pareto set is analyzed. The analysis results are applied to the leader selection strategy, and make algorithm avoid trapping in local optimum. Moreover, a clustering solution-improved method is proposed, which can increase the efficiency in searching clustering solution greatly. In the experiments, 28 datasets are used and nine state-of-the-art clustering algorithms are compared, the proposed method is superior to other approaches in the evaluation index ARI.

Cite

CITATION STYLE

APA

Gong, C., Chen, H., He, W., & Zhang, Z. (2017). Improved multi-objective clustering algorithm using particle swarm optimization. PLoS ONE, 12(12). https://doi.org/10.1371/journal.pone.0188815

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free