2023/12/25 by Itshak Lapidot, Lapidot, Itshak
Computer Science · #Advanced Clustering Algorithms Research #Bayesian Methods and Mixture Models #FOS: Computer and information sciences #Machine Learning (cs.LG)
paper · pdf · doi:10.48550/arxiv.2312.15684
openalex publication_date 2023/12/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper we presented a stochastic version mean-shift clustering algorithm. In the stochastic version the data points "climb" to the modes of the distribution collectively, while in the deterministic mean-shift, each datum "climbs" individually, while all other data points remains in their original coordinates. Stochastic version of the mean-shift clustering is comparison with a standard (deterministic) mean-shift clustering on synthesized 2- and 3-dimensional data distributed between several Gaussian component. The comparison performed in terms of cluster purity and class data purity. It was found the the stochastic mean-shift clustering outperformed in most of the cases the deterministic mean-shift.