A Robust k-Means Clustering Algorithm Based on Observation Point Mechanism. (30th March 2020)

• Record Type: Journal Article
• Authors: Zhang, Xiaoliang; He, Yulin; Jin, Yi; Qin, Honglian; Azhar, Muhammad; Huang, Joshua Zhexue
• Other Names: Guo Xianggui Academic Editor.
• Is Part Of: Complexity. Volume 2020(2020)
• Publication Date: 2020-03-30
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2020/3650926
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : The k -means algorithm is sensitive to the outliers. In this paper, we propose a robust two-stage k -means clustering algorithm based on the observation point mechanism, which can accurately discover the cluster centers without the disturbance of outliers. In the first stage, a small subset of the original data set is selected based on a set of nondegenerate observation points. The subset is a good representation of the original data set because it only contains all those points that have a higher density of the original data set and does not include the outliers. In the second stage, we use the k -means clustering algorithm to cluster the selected subset and find the proper cluster centers as the true cluster centers of the original data set. Based on these cluster centers, the rest data points of the original data set are assigned to the clusters whose centers are the closest to the data points. The theoretical analysis and experimental results show that the proposed clustering algorithm has the lower computational complexity and better robustness in comparison with k -means clustering algorithm, thus demonstrating the feasibility and effectiveness of our proposed clustering algorithm.