Computer Engineering & Science >
A KMeans Algorithm Based onthe Optimal Initial Clustering Center
Received date: 2009-06-24
Revised date: 2009-11-05
Online published: 2010-09-29
Traditional Kmeans clustering algorithms are sensitive to the selection of initial clustering centers and isolated points. Considering these problems, a new method based on the density of points is presented in this paper. First of all, we select initial clustering centers through the proposed method. Then, we apply a Kmeans clustering algorithm to cluster the data, and process the isolated points especially. The experimental results demonstrate that the proposed method can get better clustering results.
WANG Saifang,DAI Fang,WANG Wanbin,ZHANG Xiaoyu . A KMeans Algorithm Based onthe Optimal Initial Clustering Center[J]. Computer Engineering & Science, 2010 , 32(10) : 105 -107 . DOI: 10.3969/j.issn.1007130X.2010.
/
| 〈 |
|
〉 |