Clustering stability: an overview
From MaRDI portal
Publication:3569376
Abstract: A popular method for selecting the number of clusters is based on stability arguments: one chooses the number of clusters such that the corresponding clustering results are "most stable". In recent years, a series of papers has analyzed the behavior of this method from a theoretical point of view. However, the results are very technical and difficult to interpret for non-experts. In this paper we give a high-level overview about the existing literature on clustering stability. In addition to presenting the results in a slightly informal but accessible way, we relate them to each other and discuss their different implications.
Recommendations
Cited in
(40)- Estimating the number of clusters via a corrected clustering instability
- An automatic and stable clustering algorithm
- scientific article; zbMATH DE number 7307480 (Why is no real title available?)
- Clustering stability-based evolutionary K-means
- On the stability of hierarchical classification: qualitative approaches
- Detecting Lagrangian coherent structures from sparse and noisy trajectory data
- scientific article; zbMATH DE number 1928681 (Why is no real title available?)
- Measuring the stability of spectral clustering
- On the discrepancy between Kleinberg's clustering axioms and \(k\)-means clustering algorithm behavior
- Stability-Based Validation of Clustering Solutions
- Richness fallacy
- Selection of the number of clusters via the bootstrap method
- A Sober Look at Clustering Stability
- Stability estimation for unsupervised clustering: a review
- Precision medicine
- Detecting communities in attributed networks through bi-direction penalized clustering and its application
- Data stability in clustering: a closer look
- Optimality-based clustering: an inverse optimization approach
- Riding down the Bay: space-time clustering of ecological trends
- Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
- Estimation of the global mode of a density: minimaxity, adaptation, and computational complexity
- Multicuts and perturb \& MAP for probabilistic graph clustering
- Stability of k-Means Clustering
- Explaining mixture models through semantic pattern mining and banded matrix visualization
- Banks' business models in the euro area: a cluster analysis in high dimensions
- Visualizing non-metric similarities in multiple maps
- On the Estimation of the Number of Communities for Sparse Networks
- Optimal transport, mean partition, and uncertainty assessment in cluster analysis
- A statistical model of cluster stability
- Divisive clustering of high dimensional data streams
- A cautionary note on using internal cross validation to select the number of clusters
- Clustering ensemble based on sample's stability
- Modal clustering asymptotics with applications to bandwidth selection
- Good clusterings have large volume
- Adjusting the Adjusted Rand Index. A multinomial story
- A statistical view of clustering performance through the theory of U-processes
- A family of distances for preference-approvals
- Stability and model selection in \(k\)-means clustering
- Bootstrapping estimates of stability for clusters, observations and model selection
- Probabilistic correlation clustering and image partitioning using perturbed multicuts
This page was built for publication: Clustering stability: an overview
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3569376)
