收录:
摘要:
In this paper, we present a novel algorithm for performing k-means clustering using cuckoo search. A pending problem of K-Means clustering algorithm is that the performance is affected by the original cluster centers. In this paper the K-Means algorithm is improved by cuckoo search and the initial cluster centers are generated by cuckoo search. The experiments and comparisons with the classical K-Means algorithm indicate that the improved k-mean clustering algorithm has obvious advantages on execution time. © Springer Science+Business Media Singapore 2016.
关键词:
通讯作者信息:
电子邮件地址: