首页 | 官方网站   微博 | 高级检索  
     

一种局部概率引导的优化K-means++算法
引用本文:王海燕,崔文超,许佩迪,李闯.一种局部概率引导的优化K-means++算法[J].吉林大学学报(理学版),2002,57(6):1431-1436.
作者姓名:王海燕  崔文超  许佩迪  李闯
作者单位:1. 长春大学 计算机科学技术学院, 长春 130022; 2. 吉林大学 理论化学研究所, 长春 130021;3. 吉林师范大学 计算机学院, 吉林 四平 136000
摘    要:针对K-means++算法选取初始聚类中心计算误差平方和时, 实验次数对误差平方影响不准确的问题, 提出一种PK-means++算法. 结果表明, 该算法在进行分散数据聚类时, 在同一K值情形下, 聚类后的误差平方和较原K-means++算法更稳定, 从而更好地保证了随机实验取值的稳定性.

关 键 词:聚类分析    K-means++算法    概率    误差平方和  
收稿时间:2019-04-28

An Optimized K-means++ Algorithm Guided by Local Probability
WANG Haiyan,CUI Wenchao,XU Peidi,LI Chuang.An Optimized K-means++ Algorithm Guided by Local Probability[J].Journal of Jilin University: Sci Ed,2002,57(6):1431-1436.
Authors:WANG Haiyan  CUI Wenchao  XU Peidi  LI Chuang
Affiliation:1. College of Computer Science and Technology, Changchun University, Changchun 130022, China;2. Institute of Theoretical Chemistry, Jilin University, Changchun 130021, China; 3. College of Computer, Jilin Normal University, Siping 136000, Jilin Province, China
Abstract:Aiming at the problem that the numberof experiment had an inaccurate effect on the square of errors when the K- means++ algorithm was used to select the initial clustering center to calculate the sum squared error, we proposeda PK-means++ algorithm. The results show that the sum squared error after clustering is more stable than the original K-means++ algorithm under the same K-value when the algorithm clusters the scattered data, so the stabilityof random experiment value is better guaranteed.
Keywords:clustering analysis  K-means++ algorithm  probability  sum squared error  
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号