Author(s)

Jintao Han, Haiming Li^*

School of Computer Science and Technology, Shanghai University of Electric Power, Shanghai, China.

K-means clustering algorithm is an important algorithm in unsupervised learning and plays an important role in big data processing, computer vision and other research fields. However, due to its sensitivity to initial partition, outliers, noise and other factors, the clustering results in data analysis, image segmentation and other fields are unstable and weak in robustness. Based on the fast global K-means clustering algorithm, this paper proposed an improved K-means clustering algorithm. Through the neighborhood filtering mechanism, the points in the neighborhood of the selected initial clustering center have not participated in the selection of the next initial clustering center, which can effectively reduce the randomness of initial partition and improve the efficiency of initial partition. Mahalanobis distance was used in the clustering process to better consider the global nature of data. Compared with the traditional clustering algorithm and other optimization algorithms, the results of real data set testing are significantly improved.

K-Means, Cluster, Neighbourhood, Mahalanobis Distance

Han, J. and Li, H. (2019) Initial Value Filtering Optimizes Fast Global K-Means. Journal of Computer and Communications, 7, 52-62. doi: 10.4236/jcc.2019.710005.