2014 | OriginalPaper | Buchkapitel
Data Clustering Based on Particle Swarm Optimization with Neighborhood Search and Cauchy Mutation
verfasst von : Dang Cong Tran, Zhijian Wu
Erschienen in: Neural Information Processing
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.