A notion of stability for k-means clustering

01/29/2018
by   Thibaut Le Gouic, et al.
0

In this paper, we define and study a new notion of stability for the k-means clustering scheme building upon the notion of quantization of a probability measure. We connect this notion of stability to a geometric feature of the underlying distribution of the data, named absolute margin condition, inspired by recent works on the subject.

READ FULL TEXT
research
06/03/2019

A necessary and sufficient stability notion for adaptive generalization

We introduce a new notion of the stability of computations, which holds ...
research
01/11/2018

Quantization/clustering: when does k-means work?

Though mostly used as a clustering algorithm, k-means are originally des...
research
06/28/2021

Seeking Stability by being Lazy and Shallow

Designing a language feature often requires a choice between several, si...
research
07/17/2019

t-k-means: A k-means Variant with Robustness and Stability

Lloyd's k-means algorithm is one of the most classical clustering method...
research
01/11/2018

Quantization/clustering: when and why does k-means work?

Though mostly used as a clustering algorithm, k-means are originally des...
research
07/07/2022

Individual Preference Stability for Clustering

In this paper, we propose a natural notion of individual preference (IP)...
research
06/10/2013

Discriminative k-means clustering

The k-means algorithm is a partitional clustering method. Over 60 years ...

Please sign up or login with your details

Forgot password? Click here to reset