Near-optimal large-scale k-medoids clustering

The k-medoids (k-median) problem is one of the best known unsupervised clustering problems. Due to its complexity, finding high-quality solutions for huge-scale datasets remains extremely challenging. The application of many approaches finding optimal or quality solutions is limited to only small an...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information sciences Jg. 545; S. 344 - 362
Hauptverfasser:	Ushakov, Anton V., Vasilyev, Igor
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Inc 04.02.2021
Schlagworte:	CLARA K-medoids clustering MPI Nearest neighbors P-median problem Parallel and distributed computing P-median problem Parallel and distributed computing CLARA K-medoids clustering Nearest neighbors MPI
ISSN:	0020-0255, 1872-6291
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!