一种改进初始聚类中心选择的K-means算法  

Improved Initial Clustering Center Selection Method for K-means Algorithm

作　　者：陈光平[1] 王文鹏[1] 黄俊[1] 

机构地区：[1]中国计量学院信息工程学院,杭州310018

出　　处：《小型微型计算机系统》2012年第6期1320-1323,共4页Journal of Chinese Computer Systems

基　　金：浙江省教育厅科技计划项目(20060520)资助

摘　　要：针对K-means算法中聚类结果易受初始聚类中心影响的缺点,提出一种改进初始聚类中心选择的算法.该算法不断寻找最大聚类,并利用距离最大的两个数据对象作为开始的聚类中心对该聚类进行分裂,如此反复,直到得到指定聚类中心个数.用KDD CUP99数据集对改进算法进行仿真实验,实验数据表明,用该算法获得的聚类中心进行聚类相对原始的K-means算法,能获得更好的聚类结果.In allusion to the disadvantage of the clustering result easily influenced by the initial clustering centers in the K-means algorithm,an improved algorithm about initial clustering centers selection is presented.The algorithm finds the largest cluster firstly,and then makes the cluster to split by used two data objects which have the maximum distance as the first clustering centers,repeat the above steps until the specified number of clustering centers are obtained.Compared to the original algorithm,the experiment result on KDD CUP99 dataset shows that the improved algorithm has a better clustering result.

关 键 词：K-MEANS算法 入侵检测 聚类算法 网络安全 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]