一种改进的k-means算法
首发时间:2008-03-13
摘要:针对k-means算法所存在的问题进行了深入的研究,提出了一种基于聚类树来选取初始中心点改进k-means算法。有效的克服了传统k-means算法对初值敏感而导致的聚类结果不稳定的问题。实验结果表明:改进后的k-means算法优于原始算法,并且稳定性好。…… 实验结果证明了方法的有效性。
For information in English, please click here
An Improved K-means Algorithm
Abstract:The exiting problems of K-means clustering algorithm are carefully researched.An improved K-means algorithm based on a clustering tree is presented.The algorithm hava overcome the defects of K-means including sensitivity to the initial data and geting unsteady clustering result effectively . The experiments demonstrate the improved algorithm is more stable and more accurate.
Keywords: clustering The k-means algorithm Clustering stability
论文图表:
引用
No.1928920620312053****
同行评议
共计0人参与
勘误表
一种改进的k-means算法
评论
全部评论0/1000