arXiv Analytics

Sign in

arXiv:1801.01017 [cs.LG]AbstractReferencesReviewsResources

Particle Clustering Machine: A Dynamical System Based Approach

Sambarta Dasgupta, Keivan Ebrahimi, Umesh Vaidya

Published 2017-12-30Version 1

Identification of the clusters from an unlabeled data set is one of the most important problems in Unsupervised Machine Learning. The state of the art clustering algorithms are based on either the statistical properties or the geometric properties of the data set. In this work, we propose a novel method to cluster the data points using dynamical systems theory. After constructing a gradient dynamical system using interaction potential, we prove that the asymptotic dynamics of this system will determine the cluster centers, when the dynamical system is initialized at the data points. Most of the existing heuristic-based clustering techniques suffer from a disadvantage, namely the stochastic nature of the solution. Whereas, the proposed algorithm is deterministic, and the outcome would not change over multiple runs of the proposed algorithm with the same input data. Another advantage of the proposed method is that the number of clusters, which is difficult to determine in practice, does not have to be specified in advance. Simulation results with are presented, and comparisons are made with the existing methods.

Related articles: Most relevant | Search more
arXiv:1802.03936 [cs.LG] (Published 2018-02-12)
On the Needs for Rotations in Hypercubic Quantization Hashing
arXiv:1902.00033 [cs.LG] (Published 2019-01-31)
Compressed Diffusion
arXiv:2103.08493 [cs.LG] (Published 2021-03-15)
How Many Data Points is a Prompt Worth?