Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Approximate Clustering without the Approximation

Speaker  Maria Florina Balcan

Affiliation  Georgia Institute of Technology

Host  Nikhil Devanur

Duration  01:00:38

Date recorded  22 July 2010

There has been substantial work on approximation algorithms for clustering data under distance-based objective functions such as k-median, k-means, and min-sum objectives. This work is fueled in part by the hope that approximating these objectives well will indeed yield more accurate solutions. That is, for problems such as clustering proteins by function, or clustering images by subject, there is some unknown correct “target” clustering and the implicit assumption is that clusterings that are approximately optimal in terms of these distance-based measures are also approximately correct in terms of error with respect to the target. In this work we show that if we make this implicit assumption explicit — that is, if we assume that any c-approximation to the given clustering objective Phi is epsilon-close to the target — then we can produce clusterings that are O(epsilon)-close to the target, even for values c for which obtaining a c-approximation is NP-hard. In particular, for the k-median, k-means, and min-sum objectives, we show that we can achieve this guarantee for any constant c 1.

©2010 Microsoft Corporation. All rights reserved.
By the same speaker
> Approximate Clustering without the Approximation