A Distributed And Approximated Nearest Neighbors Algorithm For An Efficient Large Scale Mean Shift Clustering

Abstract

In this paper we target the class of modal clustering methods where clusters are defined in terms of the local modes of the probability density function which generates the data. The most well-known modal clustering method is the k-means clustering. Mean Shift clustering is a generalization of the k-means clustering which computes arbitrarily shaped clusters as defined as the basins of attraction to the local modes created by the density gradient ascent paths. Despite its potential, the Mean Shift approach is a computationally expensive method for unsupervised learning. Thus, we introduce two contributions aiming to provide clustering algorithms with a linear time complexity, as opposed to the quadratic time complexity for the exact Mean Shift clustering. Firstly we propose a scalable procedure to approximate the density gradient ascent. Second, our proposed scalable cluster labeling technique is presented. Both propositions are based on Locality Sensitive Hashing (LSH) to approximate

Stats

• citations27
• S2 citations—
• github stars0
• HF likes0
• heat score10.85
• arxiv keybeck2019a

Related papers

• PECANN: Parallel Efficient Clustering With Graph-based Approximate Nearest Neighbor Search (2023)0.00
• Local Distance Metric Learning For Nearest Neighbor Algorithm (2018)0.00
• Unconventional Application Of K-means For Distributed Approximate Similarity Search (2022)5.84
• Scalable K-means Clustering For Large K Via Seeded Approximate Nearest-neighbor Search (2025)0.00
• Refining A \(k\)-nearest Neighbor Graph For A Computationally Efficient Spectral Clustering (2023)12.25
• A Learning-to-rank Formulation Of Clustering-based Approximate Nearest Neighbor Search (2024)4.52
• On High-dimensional Modifications Of The Nearest Neighbor Classifier (2024)0.00
• A Memory-efficient Distributed Algorithm For Approximate Nearest Neighbour Search With Arbitrary Distances (2024)0.00