DeepAI
Log In Sign Up

Improved Guarantees for k-means++ and k-means++ Parallel

10/27/2020
by   Konstantin Makarychev, et al.
0

In this paper, we study k-means++ and k-means++ parallel, the two most popular algorithms for the classic k-means clustering problem. We provide novel analyses and show improved approximation and bi-criteria approximation guarantees for k-means++ and k-means++ parallel. Our results give a better theoretical justification for why these algorithms perform extremely well in practice. We also propose a new variant of k-means++ parallel algorithm (Exponential Race k-means++) that has the same approximation guarantees as k-means++.

READ FULL TEXT

page 1

page 2

page 3

page 4

12/22/2020

Fast and Accurate k-means++ via Rejection Sampling

k-means++ <cit.> is a widely used clustering algorithm that is easy to i...
08/13/2018

Speeding Up Constrained k-Means Through 2-Means

For the constrained 2-means problem, we present a O(dn+d(1ϵ)^O(1ϵ) n) ti...
02/22/2016

Clustering subgaussian mixtures by semidefinite programming

We introduce a model-free relax-and-round algorithm for k-means clusteri...
10/08/2016

Boost K-Means

Due to its simplicity and versatility, k-means remains popular since it ...
02/16/2022

Spatial Transformer K-Means

K-means defines one of the most employed centroid-based clustering algor...
02/14/2022

Homogenous and Heterogenous Parallel Clustering: An Overview

Recent advances in computer architecture and networking opened the oppor...
09/05/2012

Learning Manifolds with K-Means and K-Flats

We study the problem of estimating a manifold from random samples. In pa...