A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Finding Exemplars from Pairwise Dissimilarities via Simultaneous Sparse Recovery
Neural Information Processing Systems
Given pairwise dissimilarities between data points, we consider the problem of finding a subset of data points, called representatives or exemplars, that can efficiently describe the data collection. We formulate the problem as a row-sparsity regularized trace minimization problem that can be solved efficiently using convex programming. The solution of the proposed optimization program finds the representatives and the probability that each data point is associated with each one of thedblp:conf/nips/ElhamifarSV12 fatcat:sbpmbobusjcs3kgi3sm2sl3bna