A Sub-Quadratic Exact Medoid Algorithm

We present a new algorithm, trimed, for obtaining the medoid of a set, that is the element of the set which minimises the mean distance to all other elements. The algorithm is shown to have, under certain assumptions, expected run time O(N^(3/2)) in R^d where N is the set size, making it the first s...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Newling, James, Fleuret, François
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Data Structures and Algorithms Computer Science - Learning Statistics - Machine Learning
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!