An Iterative Non-parametric Clustering Algorithm Based on Local Shrinking

In this paper, we propose a new non-parametric clustering method based on local shrinking. Each data point is transformed in such a way that it moves a specific distance toward a cluster center. The direction and the associated size of each movement are determined by the median of its K-nearest neighbors. This process is repeated until a pre-defined convergence criterion is satisfied. The optimal value of the K is decided by optimizing index functions that measure the strengths of clusters. The number of clusters and the final partition are determined automatically without any input parameter except the stopping rule for convergence. Our performance studies have shown that this algorithm converges fast and achieves high accuracy.