一种改进的k-means算法
n Improved K-means Algorithm
针对k-means算法所存在的问题进行了深入的研究，提出了一种基于聚类树来选取初始中心点改进k-means算法。有效的克服了传统k-means算法对初值敏感而导致的聚类结果不稳定的问题。实验结果表明：改进后的k-means算法优于原始算法，并且稳定性好。…… 实验结果证明了方法的有效性。
he 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.
杨胜、吴晓蓉
计算技术、计算机技术
聚类K-means算法聚类稳定性
clusteringhe k-means algorithmClustering stability
杨胜,吴晓蓉.一种改进的k-means算法[EB/OL].(2008-03-13)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200803-335.点此复制
评论