Indexed by:
Abstract:
K-Means clustering algorithm attracts increasing focus in recent years. 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 particle swarm optimization and the initial cluster centers are generated by particle swarm optimization.The experiments and comparisons with the classical K-Means algorithm indicate that the improved k-mean clustering algorithm has obvious advantages on execution time. © 2014 Springer-Verlag Berlin Heidelberg.
Keyword:
Reprint Author's Address:
Email:
Source :
ISSN: 1876-1100
Year: 2014
Volume: 309 LNEE
Page: 607-612
Language: English
Cited Count:
SCOPUS Cited Count: 26
ESI Highly Cited Papers on the List: 0 Unfold All
WanFang Cited Count:
Chinese Cited Count:
30 Days PV: 10