Affiliations: [a] College of Computer Science and Engineering, Chongqing University of Technology, Banan, Chongqing, China | [b] College of Computer Science, Chongqing University, Shapingba, Chongqing, China
Correspondence:
[*]
Corresponding author: Chengyun Song, College of Computer Science and Engineering, Chongqing University of Technology, Banan, Chongqing, China. E-mail: [email protected].
Abstract: Graph-based clustering performs efficiently for identifying clusters in local and nonlinear data Patterns. The existing methods face the problem of parameter selection, such as the setting of k of the k-nearest neighbor graph and the threshold in noise detection. In this paper, a non-parametric clustering algorithm (NonPC) is proposed to tackle those inherent limitations and improve clustering performance. The weighted natural neighbor graph (wNaNG) is developed to represent the given data without any prior knowledge. What is more, the proposed NonPC method adaptively detects noise data in an unsupervised way based on some attributes extracted from wNaNG. The algorithm works without preliminary parameter settings while automatically identifying clusters with unbalanced densities, arbitrary shapes, and noises. To assess the advantages of the NonPC algorithm, extensive experiments have been conducted compared with some classic and recent clustering methods. The results demonstrate that the proposed NonPC algorithm significantly outperforms the state-of-the-art and well-known algorithms in Adjusted Rand index, Normalized Mutual Information, and Fowlkes-Mallows index aspects.
