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...

Celý popis

Podrobná bibliografia

Vydané v:	Information sciences Ročník 545; s. 344 - 362
Hlavní autori:	Ushakov, Anton V., Vasilyev, Igor
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 04.02.2021
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!