Efficient Parameter-Free Clustering Using First Neighbor Relations

Citations Over TimeTop 10% of 2019 papers

Abstract

We present a new clustering method in the form of a single clustering equation that is able to directly discover groupings in the data. The main proposition is that the first neighbor of each sample is all one needs to discover large chains and finding the groups in the data. In contrast to most existing clustering algorithms our method does not require any hyper-parameters, distance thresholds and/or the need to specify the number of clusters. The proposed algorithm belongs to the family of hierarchical agglomerative methods. The technique has a very low computational overhead, is easily scalable and applicable to large practical problems. Evaluation on well known datasets from different domains ranging between 1077 and 8.1 million samples shows substantial performance gains when compared to the existing clustering techniques.

Related Papers

• Study on PCA based Hierarchical k-means Clustering Algorithm(2012)
• → Hierarchical and k ‐Means Clustering(2014)3 cited
• → Hierarchical Clustering Algorithm Based on Fast and Uniform Segmentation(2022)