K-means clustering algorithm based on improved Cuckoo search algorithm and its application

Because the K-Means algorithm is easy to fall into the local optimum and the Cuckoo search (CS) algorithm is affected by the step size, this paper proposes a K-Means clustering algorithm based on improved cuckoo search (ICS-Kmeans). The algorithm is compared with the original K-means, the Kmeans alg...

Full description

Saved in:

Bibliographic Details
Published in:	2018 IEEE 3rd International Conference on Big Data Analysis (ICBDA) pp. 422 - 426
Main Authors:	Ye, Shuce, Huang, Xiaoli, Teng, Yinyin, Li, Yuxia
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.03.2018
Subjects:	Birds Classification algorithms Clustering algorithms Convergence cuckoo search heart sound characteristics Integrated circuits K-Means Optimization Partitioning algorithms
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	Because the K-Means algorithm is easy to fall into the local optimum and the Cuckoo search (CS) algorithm is affected by the step size, this paper proposes a K-Means clustering algorithm based on improved cuckoo search (ICS-Kmeans). The algorithm is compared with the original K-means, the Kmeans algorithm based on particle swarm optimization (PSO-Kmeans) and the K-Means algorithm based on the cuckoo search (CS-Kmeans). The experimental results show that the proposed algorithm can obtain better clustering effect, faster convergence rate and better accuracy rate through the experimental test on the UCI standard data set. The algorithm is also applied to the clustering of the characteristic parameters of the heart sound MFCC. The results show that a better clustering center can be obtained, the algorithm converges fast.
DOI:	10.1109/ICBDA.2018.8367720