计算机技术与发展2011，Vol.21Issue(2)：62-65,4.
K-Means聚类算法的研究
The Research about Clustering Algorithm of K-Means
摘要
Abstract
The algorithm of K-means is one kind of classical clustering algorithm, including both many points and also shortages.For example must choose the initial clustering number.The choose of initial clustering centre has randomness.The algorithm receives locally optimal solution easily, the effect of isolated point is serious.Mainly improved the choice of initial clustering centre and the problem of isolated point.First of all ,the algorithm calculated distance between all data and eliminated the effect of isolated point.Then proposed one new method for choosing the initial clustering centre and compared the algorithm having improved and the original algorithm using the experiment.The experiments indicate that the effect of isolated point for algorithm having improved reduces obviously, the results of clustering approach the actual distribution of the data.关键词
K-Means算法/初始聚类中心/孤立点分类
信息技术与安全科学引用本文复制引用
周爱武,于亚飞..K-Means聚类算法的研究[J].计算机技术与发展,2011,21(2):62-65,4.基金项目
安徽省教育科研重点项目(KJ2009A57) （KJ2009A57）
