Convex Clustering with Exemplar-Based Models.
Danial Lashkari, Polina Golland · PubMed · 2007
. The resulting clustering can be thought of as a probabilistic mapping of the data points to the set of exemplars that minimizes the average distance and the information-theoretic cost of mapping. We present experimental results illustrating the performance of our algorithm and its comparison with the conventional approach to mixture model clustering.