A Modified Cuckoo Search Algorithm for Data Clustering
OAI: oai:igi-global.com:284572 • DOI: 10.4018/IJAMC.2022010101
Published by: IGI Global
Abstract
Clustering of data is one of the necessary data mining techniques, where similar objects are grouped in the same cluster. In recent years, many nature-inspired based clustering techniques have been proposed, which have led to some encouraging results. This paper proposes a Modified Cuckoo Search (MoCS) algorithm. In this proposed work, an attempt has been made to balance the exploration of the Cuckoo Search (CS) algorithm and to increase the potential of the exploration to avoid premature convergence. This algorithm is tested using fifteen benchmark test functions and is proved as an efficient algorithm in comparison to the CS algorithm. Further, this method is compared with well-known nature-inspired algorithms such as Ant Colony Optimization (ACO), Artificial Bee Colony (ABC), Particle Swarm Optimization (PSO), Particle Swarm Optimization with Age Group topology (PSOAG) and CS algorithm for clustering of data using six real datasets. The experimental results indicate that the MoCS algorithm achieves better results as compared to other algorithms in finding optimal cluster centers.