K-means-ten clustering algorithm based on min-max criterion and region division

Aiming at the problem of unstable clustering results and low solution accuracy of -means- + algorithm, an I--means-+ clustering algorithm based on min-max criterion and region division is proposed. Firstly, the min-max criterion is proposed to calculate the distance from each data point to the nearest center, and the data point with the largest distance is preferentially selected as the new cluster center to avoid the situation where multiple initial centers are clustered in the same cluster; secondly, the data points in the split cluster are divided into different regions, and a data point is selected in each region as the candidate center to increase the diversity of the candidate centers; finally, for the clusters that fail to pair, the new split cluster is reselected by gain to pair with the original deleted cluster again to improve the pairing success rate and further reduce the objective function value. Experimental results show that compared with the I means-+ algorithm, the proposed algorithm has an average improvement in solution accuracy −k −and a more stable clustering result kunder the premise of basically equivalent operation efficiency compared with 6.47%-means and kmeans+ algorithms, the proposed algorithm has higher solution accuracy.