DeepAI AI Chat
Log In Sign Up

Clustering Stable Instances of Euclidean k-means

by   Abhratanu Dutta, et al.

The Euclidean k-means problem is arguably the most widely-studied clustering problem in machine learning. While the k-means objective is NP-hard in the worst-case, practitioners have enjoyed remarkable success in applying heuristics like Lloyd's algorithm for this problem. To address this disconnect, we study the following question: what properties of real-world instances will enable us to design efficient algorithms and prove guarantees for finding the optimal clustering? We consider a natural notion called additive perturbation stability that we believe captures many practical instances. Stable instances have unique optimal k-means solutions that do not change even when each point is perturbed a little (in Euclidean distance). This captures the property that the k-means optimal solution should be tolerant to measurement errors and uncertainty in the points. We design efficient algorithms that provably recover the optimal clustering for instances that are additive perturbation stable. When the instance has some additional separation, we show an efficient algorithm with provable guarantees that is also robust to outliers. We complement these results by studying the amount of stability in real datasets and demonstrating that our algorithm performs well on these benchmark datasets.


page 1

page 2

page 3

page 4


Clustering Perturbation Resilient Instances

Euclidean k-means is a problem that is NP-hard in the worst-case but oft...

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means

We investigate the complexity of solving stable or perturbation-resilien...

Individual Preference Stability for Clustering

In this paper, we propose a natural notion of individual preference (IP)...

Bilu-Linial stability, certified algorithms and the Independent Set problem

We study the notion of Bilu-Linial stability in the context of Independe...

Clustering under Perturbation Stability in Near-Linear Time

We consider the problem of center-based clustering in low-dimensional Eu...

Learning-Augmented k-means Clustering

k-means clustering is a well-studied problem due to its wide applicabili...

Euclidean 3D Stable Roommates is NP-hard

We establish NP-completeness for the Euclidean 3D Stable Roommates probl...