Journal of Jilin University Science Edition ›› 2019, Vol. 57 ›› Issue (06): 1431-1436.

Previous Articles     Next Articles

An Optimized K-means++ Algorithm Guided by Local Probability

WANG Haiyan1,2, CUI Wenchao3, XU Peidi3, LI Chuang3   

  1. 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
  • Received:2019-04-28 Online:2019-11-26 Published:2019-11-21
  • Contact: WANG Haiyan E-mail:jlsdwhy_0820@sina.cn

Abstract: Aiming at the problem that the number of 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 proposed a 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 stability of random experiment value is better guaranteed.

Key words: clustering analysis, K-means++ algorithm, probability, sum squared error

CLC Number: 

  • TP39