BOOTSTRAPPING K-MEANS CLUSTERING

DOI10.5183/jjscs1988.3.1zbMath0736.62053OpenAlexW1981277287MaRDI QIDQ3971796

Myoungshic Jhun 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

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

Mathematics Subject Classification ID

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

Related Items (2)

On the added value of bootstrap analysis for \(K\)-means clustering ⋮ Numerical studies of MacQueen's \(k\)-means algorithm for computing the centroidal Voronoi tessellations

This page was built for publication: BOOTSTRAPPING K-MEANS CLUSTERING