BOOTSTRAPPING K-MEANS CLUSTERING

DOI10.5183/JJSCS1988.3.1MaRDI QIDQ3971796zbMATH OpenOpenAlexFDO

Authors Myoungshic Jhun

Publication date 25 June 1992

Published in Journal of the Japanese Society of Computational Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.5183/jjscs1988.3.1

zbMATH Keywords

central limit theorem\(k\)-means clusteringMonte Carlo simulationtriangular arraybootstrap distributionasymptotic behavior of empirical processes on Vapnik-Chervonenkis classesbootstrap confidence setsoptimal cluster centersPollard's confidence sets

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Asymptotic distribution theory in statistics (62E20) Nonparametric statistical resampling methods (62G09)

Recommendations

• On the added value of bootstrap analysis for K-means clustering
• Approximate Confidence Intervals for the Number of Clusters
• Strong consistency of \(k\)-parameters clustering
• Asymptotics of \(k\)-mean clustering under non-i.i.d. sampling
• Asymptotic properties of univariate sample k-means clusters

Cited in

(7)

• Bootstrapping for Significance of Compact Clusters in Multidimensional Datasets
• On the added value of bootstrap analysis for K-means clustering
• Weak limit theorems for univariate \(k\)-mean clustering under a nonregular condition
• Bootstrap method to evaluate tightness of clusters with application to the Korean standard occlusion study
• Numerical studies of MacQueen's k-means algorithm for computing the centroidal Voronoi tessellations
• Approximate Confidence Intervals for the Number of Clusters
• K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means

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)