Nearest Neighbour Equilibrium Clustering
Not on the map. Why?
Abstract (arXiv)
A novel and intuitive nearest neighbours based clustering algorithm is introduced, in which a cluster is defined in terms of an equilibrium condition which balances its size and cohesiveness. The formulation of the equilibrium condition allows for a quantification of the strength of alignment of each point to a cluster, with these cluster alignment strengths leading naturally to a model selection criterion which renders the proposed approach fully automatable. The algorithm is simple to implement and computationally efficient, and produces clustering solutions of extremely high quality in comparison with relevant benchmarks from the literature. R code to implement the approach is available from https://github.com/DavidHofmeyr/NNEC.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 25 references that are in the map. First posted on arXiv 27 Mar 2025.
Builds on
1 of 25 references.
References · 1
- 2016Border-Peeling Clusteringcited by 5
Built on by
Not cited yet.