A Probabilistic ${\ell }_1$ Method for Clustering High Dimensional Data

Tsvetan Asamov, Adi Ben-Israel

In general, the clustering problem is NP-hard, and global optimality cannot be established for non-trivial instances. For high-dimensional data, distance-based methods for clusteri…