Affiliations: College of Intelligence Science and Technology, National University of Defense Technology, Changsha, Hunan, China
Correspondence:
[*]
Corresponding author: Haibin Xie, College of Intelligence Science and Technology, National University of Defense Technology, Changsha, Hunan 410000, China. E-mail: xhb2575_sx@sina.com.
Abstract: Based on the shape characteristics of the sample distribution in the clustering problem, this paper proposes an extended clustering algorithm based on cluster shape boundary (ECBSB). The algorithm automatically determines the number of clusters and classification discrimination boundaries by finding the boundary closures of the clusters from a global perspective of the sample distribution. Since ECBSB is insensitive to local features of the sample distribution, it can accurately identify clusters on complex shape and uneven density distribution. ECBSB first detects the shape boundary points of the cluster in the sample set with edge noise points eliminated, and then generates boundary closures around the cluster based on the boundary points. Finally, the cluster labels of the boundary are propagated to the entire sample set by a nearest neighbor search. The proposed method is evaluated on multiple benchmark datasets. Exhaustive experimental results show that the proposed method achieves highly accurate and robust clustering results, and is superior to the classical clustering baselines on most of the test data.
Keywords: Clustering, global characteristics, boundary closure, complicated shape
