Clustering using improved cuckoo search algorithm

8Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cuckoo search (CS) is one of the new swarm intelligence optimization algorithms inspired by the obligate brood parasitic behavior of cuckoo, which used the idea of Lévy flights. But the convergence and stability of the algorithm is not ideal due to the heavy-tail property of Lévy flights. Therefore an improved cuckoo search (ICS) algorithm for clustering is proposed, in which the movement and randomization of the cuckoo is modified. The simulation results of ICS clustering method on UCI benchmark data sets compared with other different clustering algorithms show that the new algorithm is feasible and efficient in data clustering, and the stability and convergence speed both get improved obviously.

Cite

CITATION STYLE

APA

Zhao, J., Lei, X., Wu, Z., & Tan, Y. (2014). Clustering using improved cuckoo search algorithm. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8794, 479–488. https://doi.org/10.1007/978-3-319-11857-4_54

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