K-means is one of the most popular clustering algorithm, it has been successfully applied in solving many practical clustering problems, however there exist some drawbacks such as local optimal convergence and sensitivity to initial points. In this paper, a new approach based on enhanced particle swarm optimization (PSO) is presented (denoted CMPNS), in which PSO is enhanced by new neighborhood search strategy and Cauchy mutation operation. Experimental results on fourteen used artificial and real-world datasets show that the proposed method outperforms than that of some other data clustering algorithms in terms of accuracy and convergence speed.
CITATION STYLE
Tran, D. C., & Wu, Z. (2014). Data clustering based on particle swarm optimization with neighborhood search and cauchy mutation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8835, pp. 151–159). Springer Verlag. https://doi.org/10.1007/978-3-319-12640-1_19
Mendeley helps you to discover research relevant for your work.