Efficient approximation algorithms for clustering point-sets

In this paper, we consider the problem of clustering a set of n finite point-sets in d-dimensional Euclidean space. Different from the traditional clustering problem (called points clustering problem where the to-be-clustered objects are points), the point-sets clustering problem requires that all p...

Full description

Bibliographic Details

Published in:	Computational geometry : theory and applications Vol. 43; no. 1; pp. 59 - 66
Main Authors:	Xu, Guang, Xu, Jinhui
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 2010
Subjects:	Clustering Core-sets K-center clustering K-median clustering Point-sets K-center clustering Point-sets Core-sets Clustering K-median clustering
ISSN:	0925-7721
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!