Improved Research to K-means Initial Cluster Centers

K-means in the field of clustering analysis algorithms is a kind of more traditional algorithm. It exists many shortcomings. For example, K value is easily affected by man-made subjective factors, and the algorithm is easy to fall into a local optimal solution, and the clustering result is not stable, etc, And K-means++ algorithm as the classic improved algorithm of K-means algorithm, but there is still a phenomenon of unstable cluster center. This paper is a kind of improvement aimed at the shortcoming of K-means++ algorithm, which introduces the concept of the variance in probability and mathematical statistics. Variance reflects the degree of density between samples and other samples. In the K-means++ algorithm when you select the first initial clustering center, you need to select minimum variance of sample points, which is in the position of the largest sample density, then you select the next cluster centers based on the weight method of D
²
which is described in the K-means++ algorithm. Experimental results show the accuracy is higher and stability is better.