improved coa with chaotic initialization and intelligent migration for data clustering

K-means algorithm is a well-known clustering algorithm. in spite of its advantages such as high speed and ease of employment, this algorithm suffers from the problem of local optima. in order to overcome this problem, a lot of works have been carried out on clustering. this paper presents a hybrid extended cuckoo optimization algorithm (ecoa) and k-means (k) algorithm called ecoa-k. the coa algorithm has advantages such as fast convergence rate, intelligent operators, and a simultaneous local and global search work, which are the motivations behind choosing this algorithm. in ecoa, we have enhanced the operators in the classical version of the cuckoo algorithm. the proposed operator for production of the initial population is based upon a chaos sequence, whereas in the classical version, it is based upon a randomized series. moreover, allocating the number of eggs to each cuckoo in the revised algorithm is done based on its fitness. another improvement is in the cuckoos’ migration, which is performed with different deviation degrees. the proposed method is evaluated on several standard datasets at the uci database, and its performance is compared with those of black hole (bh), big bang big crunch (bbbc), cuckoo search algorithm (csa), traditional cuckoo optimization algorithm (coa), and k-means algorithm. the results obtained are compared in terms of the purity degree, coefficient of variance, convergence rate, and time complexity. the simulation results show that the proposed algorithm is capable of yielding the optimized solution with a higher purity degree, faster convergence rate, and stability, in comparison with the other algorithms.