K-means Optimization Method Based On Adaptive Parallel Hierarchical Clustering
Xinchen Ma · 2023
The two key steps of the K-means algorithm are the selection of the clustering number and the selection of the initial clustering center, which will seriously affect the classification accuracy and efficiency of K-means, and need further optimization. Aiming at the selection of the number of clusters, a K-means optimization method based on adaptive parallel hierarchical clustering is proposed. In the merging process of hierarchical clustering, the optimal number of clusters is selected adaptively by improving the clustering effect evaluation function, and the Parallel computing method is used instead of the serial computing method to improve the computing speed. Aiming at selecting cluster centers more accurately, an optimized data density model is proposed to make full use of potentially related information between samples, which improves the classification accuracy of the algorithm. More importantly, it overcomes the problem of the strong subjectivity of super-parameter selection. The improved algorithm was tested with the ablation experiment method and compared to other traditional algorithms on iris and seed data sets. The results showed that the optimization algorithm could accelerate the calculation speed and improve the classification accuracy.