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

Full description

Bibliographic Details

Published in:	Information sciences Vol. 545; pp. 344 - 362
Main Authors:	Ushakov, Anton V., Vasilyev, Igor
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 04.02.2021
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!