首页> 外文会议>Intelligent Information Technology and Security Informatics (IITSI), 2010 >Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm
【24h】

Research on k-means Clustering Algorithm: An Improved k-means Clustering Algorithm

机译:k均值聚类算法研究:一种改进的k均值聚类算法

获取原文

摘要

Clustering analysis method is one of the main analytical methods in data mining, the method of clustering algorithm will influence the clustering results directly. This paper discusses the standard k-means clustering algorithm and analyzes the shortcomings of standard k-means algorithm, such as the k-means clustering algorithm has to calculate the distance between each data object and all cluster centers in each iteration, which makes the efficiency of clustering is not high. This paper proposes an improved k-means algorithm in order to solve this question, requiring a simple data structure to store some information in every iteration, which is to be used in the next interation. The improved method avoids computing the distance of each data object to the cluster centers repeatly, saving the running time. Experimental results show that the improved method can effectively improve the speed of clustering and accuracy, reducing the computational complexity of the k-means.
机译:聚类分析方法是数据挖掘中的主要分析方法之一,聚类算法的方法将直接影响聚类结果。本文讨论了标准k均值聚类算法并分析了标准k均值算法的缺点,例如k均值聚类算法必须在每次迭代中计算每个数据对象与所有聚类中心之间的距离,从而提高了效率聚类度不高。为了解决这个问题,本文提出了一种改进的k-means算法,要求一种简单的数据结构在每次迭代中存储一些信息,该信息将在下一次交互中使用。改进的方法避免了重复计算每个数据对象到聚类中心的距离,从而节省了运行时间。实验结果表明,改进后的方法可以有效提高聚类速度和准确性,降低了k均值的计算复杂度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号