Approximate Confidence Intervals for the Number of Clusters

DOI10.2307/2289862MaRDI QIDQ3831883zbMATH OpenOpenAlexFDO

Authors Roger Peck, Lloyd Fisher, John W. Van Ness

Publication date 1989

Full work available at URL https://doi.org/10.2307/2289862

zbMATH Keywords

approximate confidence boundsboostrap-based proceduredata reductionk-means clusteringsloss functionloss of informationoptimal clusteringparsimonysimulation studystrong consistency

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Recommendations

• Optimal clustering on the real line
• Clustering confidence sets
• BOOTSTRAPPING K-MEANS CLUSTERING
• A new approach to clustering
• On the number of clusters

Cited in

(11)

• Optimal clustering on the real line
• Classification of binary vectors by stochastic complexity.
• Space-conserving agglomerative algorithms
• On the added value of bootstrap analysis for K-means clustering
• A statistical view of clustering performance through the theory of U-processes
• BOOTSTRAPPING K-MEANS CLUSTERING
• An automated robust algorithm for clustering multivariate data
• MCS: A method for finding the number of clusters
• A novel clustering method with maximum number of ordered centroids and stable clusters for optimal ranking in a univariate setting
• Cluster validation based on Fisher's linear discriminant analysis
• Clustering confidence sets

Describes a project that uses

Uses Software

• AS 136

This page was built for publication: Approximate Confidence Intervals for the Number of Clusters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3831883)