Choosing Exemplars (Medoids)
like k-means, but means must be data points
Algorithms:
greedy k-means
affinity propagation (Frey & Dueck 2007)
medoid shift (Sheikh et al. 2007)
Scene Summarization