2018
Medoids in Almost-Linear Time via Multi-Armed Bandits
AISTATS 2018poster
Computing the medoid of a large number of points in high-dimensional space is an increasingly common operation in many data science problems. We present an algorithm Med-dit to compute the medoid with high probability, which uses $O(n\log n)$ distance evaluations. Med-dit is based on a connection wi…