首页 | 本学科首页   官方微博 | 高级检索  
     

一种有效的k-means聚类初始中心选取方法
引用本文:任景彪,尹绍宏.一种有效的k-means聚类初始中心选取方法[J].计算机与现代化,2010(7):84-86,92.
作者姓名:任景彪  尹绍宏
作者单位:天津工业大学,天津,300160
摘    要:针对传统k-means聚类算法中对初始聚类中心随意选取和人为指定的缺陷,提出一种改进的初始聚类中心的选取方法,利用差异矩阵将新的聚类初始中心计算方法用在传统的k-means算法思想中,对传统的k-means算法进行改进。降低k-means算法的复杂度和对异常点的敏感度,提高算法的可伸缩性。

关 键 词:k-means  聚类  初始化中心  差异矩阵

An Effective Method for Initial Centrepoints of K-means Clustering
REN Jing-biao,YIN Shao-hong.An Effective Method for Initial Centrepoints of K-means Clustering[J].Computer and Modernization,2010(7):84-86,92.
Authors:REN Jing-biao  YIN Shao-hong
Affiliation:(Tianjin Polytechnic University,Tianjin 300160,China)
Abstract:In this paper,a improved initial cluster center selection method is presented for the defects of the traditional k-means cluster algorithm on the initial cluster center selection,and uses the new cluster initial center calculation method on the mind of traditional k-means algorithm.It is shown that the new algorithm not only reduces the complexity of k-means algorithm,but also improves the scalability of the k-means algorithm.
Keywords:k-means
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号