基于初始聚类中心优化的K均值算法
收稿日期: 2009-06-24
修回日期: 2009-11-05
网络出版日期: 2010-09-29
基金资助
西安理工大学校博士启动金资助项目(108210905);陕西省教育厅科学计划研究计划项目(09Jk611)
A KMeans Algorithm Based onthe Optimal Initial Clustering Center
Received date: 2009-06-24
Revised date: 2009-11-05
Online published: 2010-09-29
王赛芳,戴芳,王万斌,张晓宇 . 基于初始聚类中心优化的K均值算法[J]. 计算机工程与科学, 2010 , 32(10) : 105 -107 . DOI: 10.3969/j.issn.1007130X.2010.
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.
/
| 〈 |
|
〉 |