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

最小局部方差优化初始聚类中心的 K-means 算法
引用本文:王世其,张文斌,蔡潮森,李建军.最小局部方差优化初始聚类中心的 K-means 算法[J].教育技术导刊,2020,19(6):196-200.
作者姓名:王世其  张文斌  蔡潮森  李建军
作者单位:南京理工大学 理学院,江苏 南京 210094
基金项目:江苏省大学生创新创业训练计划项目(201810288003Y)
摘    要:针对传统 K-means 算法随机选取初始聚类中心导致聚类结果随机性大、优劣不定的缺点,通过定义局部方差,利用方差反映数据密集程度的特性,提出一种基于最小 局部方差优化初始聚类中心的 K-means 算 法。该算法选取数据集中局部方差最小的点作为一个初始聚类中心,并利用数据信息更新数据集,直到选到 k个初始聚类中心,实现初始聚类中心优化。基于 UCI 数据集与人工数据集进行实验,与传统 K-means 算法及最小方差优化初始聚类中心的 K-means 算法进行性能比较。实验结果表明,基于最小局部方差优化初始聚类中心的 K-means算法具有良好的聚类效果和很好的鲁棒性,且聚类时间较短,验证了算法有效性和优越性。

关 键 词:聚类  K-means  算法  初始化聚类中心  局部方差  密集程度  
收稿时间:2019-08-21

K-means Algorithm Based on Minimum Local Variance Initialized Clustering Centers
WANG Shi-qi,ZHANG Wen-bin,CAI Chao-sen,LI Jian-jun.K-means Algorithm Based on Minimum Local Variance Initialized Clustering Centers[J].Introduction of Educational Technology,2020,19(6):196-200.
Authors:WANG Shi-qi  ZHANG Wen-bin  CAI Chao-sen  LI Jian-jun
Institution:College of Science,Nanjing University of Science and Technology,Nanjing 210094,China
Abstract:The traditional K-means algorithm randomly selects the initial clustering center,which leads to great randomness of the clustering results. To overcome this problem,considering the characteristics of variance reflecting data intensity,we propose a K-means algorithm based on minimum local variance to optimize the initial clustering center. The method selects the point with the smallest local variance in the dataset as an initial clustering center,and updates the dataset with the data information until the K initial clustering centers are selected. The performance of the proposed algorithm and the traditional algorithm and the k-means algorithm based on minimum variance initialized clustering conters compared by UCI dataset and artificial dataset experiments. The experimental results show that the proposed algorithm has good clustering effect,short clustering time and good robustness. The effectiveness and superiority of the proposed algorithm are verified.
Keywords:clustering  K-means algorithm  initialized clustering centers  local variance  intensive degree  
点击此处可从《教育技术导刊》浏览原始摘要信息
点击此处可从《教育技术导刊》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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