Local Search Yields a PTAS for k-Means in Doubling Metrics

@article{Friggstad2016LocalSY,
  title={Local Search Yields a PTAS for k-Means in Doubling Metrics},
  author={Zachary Friggstad and M. Rezapour and M. Salavatipour},
  journal={2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)},
  year={2016},
  pages={365-374}
}
  • Zachary Friggstad, M. Rezapour, M. Salavatipour
  • Published 2016
  • Mathematics, Computer Science
  • 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)
  • The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly k-MEANS: given a set of data points and a parameter k, select k centres and partition the data points into k clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized. Typically these data points lie in Euclidean space Rd for some d ≥ 2. k-MEANS and the first algorithms for it were introduced in the 1950's. Over the… CONTINUE READING
    71 Citations
    Approximation algorithms for geometric dispersion
    • 2
    • PDF
    Approximation Schemes for Clustering with Outliers
    • 6
    Improved PTAS for the constrained k-means problem
    • 6
    On Euclidean k-Means Clustering with alpha-Center Proximity
    • 3
    • PDF
    Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
    • 11
    • PDF
    Approximation Schemes for Clustering with Outliers
    • 19
    • PDF
    Better Guarantees for k-Means and Euclidean k-Median by Primal-Dual Algorithms
    • 103
    • PDF
    Approximation algorithms for spherical k-means problem using local search scheme
    • 1
    Noisy, Greedy and Not So Greedy k-means++
    • 4
    • PDF
    Classification and Approximation of Geometric Location Problems
    • 1

    References

    SHOWING 1-10 OF 66 REFERENCES
    A local search approximation algorithm for k-means clustering
    • 548
    • Highly Influential
    • PDF
    A Nearly Linear-Time Approximation Scheme for the Euclidean kappa-median Problem
    • 98
    • PDF
    Approximation schemes for Euclidean k-medians and related problems
    • 365
    • PDF
    k-means requires exponentially many iterations even in the plane
    • 146
    • PDF
    On coresets for k-means and k-median clustering
    • 426
    How Fast Is the k-Means Method?
    • 135
    • PDF
    The Hardness of Approximation of Euclidean k-Means
    • 113
    • Highly Influential
    • PDF
    Clustering Large Graphs via the Singular Value Decomposition
    • 459
    • PDF
    Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
    • 88
    • PDF
    Smoothed Analysis of the k-Means Method
    • 79
    • PDF