BOOTSTRAPPING K-MEANS CLUSTERING
From MaRDI portal
Recommendations
Cited in
(8)- Weak limit theorems for univariate \(k\)-mean clustering under a nonregular condition
- Numerical studies of MacQueen's k-means algorithm for computing the centroidal Voronoi tessellations
- K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means
- On the added value of bootstrap analysis for K-means clustering
- Approximate Confidence Intervals for the Number of Clusters
- Bootstrapping for Significance of Compact Clusters in Multidimensional Datasets
- Bootstrap method to evaluate tightness of clusters with application to the Korean standard occlusion study
- A novel clustering method with maximum number of ordered centroids and stable clusters for optimal ranking in a univariate setting
This page was built for publication: BOOTSTRAPPING K-MEANS CLUSTERING
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971796)