Article thumbnail

A Bad Instance for k-means++

By Tobias Brunsch and Heiko Röglin

Abstract

k-means++ is a seeding technique for the k-means method with an expected approximation ratio of O(log k), where k denotes the number of clusters. Examples are known on which the expected approximation ratio of k-means++ is Ω(log k), showing that the upper bound is asymptotically tight. However, it remained open whether k-means++ yields an O(1)-approximation with probability 1/poly(k) or even with constant probability. We settle this question and present instances on which k-means++ achieves an approximation ratio of (2/3 − ε) · log k only with exponentially small probability

Year: 2011
DOI identifier: 10.1007/978-3-642-20877-5_34
OAI identifier: oai:CiteSeerX.psu:10.1.1.229.411
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www-i1.informatik.rwth-... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles