Abstract
Clustering is a process to discover unseen patterns in a given set of objects. Objects belonging to the same pattern are homogenous in nature while they are heterogeneous in other patterns. In this paper, a hybrid data clustering algorithm comprising of improved cat swarm optimization (CSO) and K-h armonic means (KHM) is proposed to solve the clustering problem. The proposed algorithm exhibits strengths of both the mentioned algorithms, it is named as improved CSOKHM (ICSOKHM). The performance of the proposed algorithm is evaluated using seven datasets and is compared with existing algorithms like KHM, PSO, PSOKHM, ACA, ACAKHM, GSAKHM and CSO. The experimental results demonstrate that the proposed algorithm not only improves the convergence speed of CSO algorithm but also prevents KHM algorithm from running into local optima.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
