Sublinear-time approximation for clustering via random sampling

Document Type

Article

Publication Date

1-1-2004

Abstract

In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sun k-clustering, and balanced k-median. For all these problems we consider the following simple sampling scheme: select a small sample set of points uniformly at random from V and then run some approximation algorithm on this sample set to compute an approximation of the best possible clustering of this set. Our main technical contribution is a significantly strengthened analysis of the approximation guarantee by this scheme for the clustering problems. The main motivation behind our analyses was to design sublinear-time algorithms for clustering problems. Our second contribution is the development of new approximation algorithms for the aforementioned clustering problems. Using our random sampling approach we obtain for the first time approximation algorithms. that have the running time independent of the input size, and depending on k and the diameter of the metric space only. © Springer-Verlag Berlin Heidelberg 2004.

Identifier

35048875680 (Scopus)

ISBN

[3540228497]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-540-27836-8_35

e-ISSN

16113349

ISSN

03029743

First Page

396

Last Page

407

Volume

3142

This document is currently not available here.

Share

COinS