Nearest Neighbour Equilibrium Clustering
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.
Code (1)
Tasks
ClusteringModel SelectionSimilar Papers 제목 키워드 기반
Nearest-Neighbour-Induced Isolation Similarity and its Impact on Density-Based Clustering
A recent proposal of data dependent similarity called Isolation Kernel/Similarity has enabled SVM to produce better classification accuracy. We identify shortcomings of using a tree method to implement Isolation Similari…
ClusteringAn efficient density-based clustering algorithm using reverse nearest neighbour
Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based…
ClusteringEvaluation of Machine Learning-based Anomaly Detection Algorithms on an Industrial Modbus/TCP Data Set
In the context of the Industrial Internet of Things, communication technology, originally used in home and office environments, is introduced into industrial applications. Commercial off-the-shelf products, as well as un…
Anomaly DetectionBIG-bench Machine LearningClusteringDensity Adaptive Parallel Clustering
In this paper we are going to introduce a new nearest neighbours based approach to clustering, and compare it with previous solutions; the resulting algorithm, which takes inspiration from both DBscan and minimum spannin…
ClusteringNeighbour Consistency Guided Pseudo-Label Refinement for Unsupervised Person Re-Identification
Unsupervised person re-identification (ReID) aims at learning discriminative identity features for person retrieval without any annotations. Recent advances accomplish this task by leveraging clustering-based pseudo labe…
ClusteringPerson Re-IdentificationPerson RetrievalPseudo Label+2