The reviewed record of science sign in
Pith

arxiv: 2006.08530 · v3 · pith:N6WDJADK · submitted 2020-06-15 · cs.LG · stat.ML

Selecting the Number of Clusters K with a Stability Trade-off: an Internal Validation Criterion

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:N6WDJADKrecord.jsonopen to challenge →

classification cs.LG stat.ML
keywords clusteringclusterscriterionnumbershouldstabilityfindprinciple
0
0 comments X
read the original abstract

Model selection is a major challenge in non-parametric clustering. There is no universally admitted way to evaluate clustering results for the obvious reason that no ground truth is available. The difficulty to find a universal evaluation criterion is a consequence of the ill-defined objective of clustering. In this perspective, clustering stability has emerged as a natural and model-agnostic principle: an algorithm should find stable structures in the data. If data sets are repeatedly sampled from the same underlying distribution, an algorithm should find similar partitions. However, stability alone is not well-suited to determine the number of clusters. For instance, it is unable to detect if the number of clusters is too small. We propose a new principle: a good clustering should be stable, and within each cluster, there should exist no stable partition. This principle leads to a novel clustering validation criterion based on between-cluster and within-cluster stability, overcoming limitations of previous stability-based methods. We empirically demonstrate the effectiveness of our criterion to select the number of clusters and compare it with existing methods. Code is available at https://github.com/FlorentF9/skstab.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.