Initializing k-means clustering by bootstrap and data depth

DOI10.1007/S00357-020-09372-3MaRDI QIDQ2236768zbMATH OpenOpenAlexFDO

Authors Aurora Torrente, Juan Romo

Publication date 26 October 2021

Published in Journal of Classification (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00357-020-09372-3

zbMATH Keywords

bootstrap\(k\)-means algorithmMBD data depth

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• scientific article; zbMATH DE number 3942813 (Why is no real title available?)
• scientific article; zbMATH DE number 3470045 (Why is no real title available?)
• scientific article; zbMATH DE number 3541764 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1843028 (Why is no real title available?)
• scientific article; zbMATH DE number 854575 (Why is no real title available?)
• scientific article; zbMATH DE number 3340881 (Why is no real title available?)
• A central limit theorem for k-means clustering
• A robust clustering method and visualization tool based on data depth
• A variable-selection heuristic for K-means clustering
• Adaptive initialization method based on spatial local information for \(k\)-means algorithm
• Advances in computer science and information technology. First international conference on computer science and information technology, CCSIT 2011, Bangalore, India, January 2--4, 2011. Proceedings, Part I
• Bootstrapping cluster analysis: Assessing the reliability of conclusions from microarray experi\-ments.
• Cluster-wise assessment of cluster stability
• Clustering and classification based on the L\(_{1}\) data depth
• Clustering to minimize the maximum intercluster distance
• Descriptive statistics for multivariate distributions
• Finding Groups in Data
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• On a notion of data depth based on random simplices
• On strategies to fix degenerate \(k\)-means solutions
• On the Concept of Depth for Functional Data
• On the added value of bootstrap analysis for K-means clustering
• Optimising \(k\)-means clustering results with standard software packages
• The multivariate L ₁ -median and associated data depth
• The planar \(k\)-means problem is NP-hard

Cited in

(2)

• Clustering directional data through depth functions
• Band depth based initialization of K-means for functional data clustering

Describes a project that uses

Uses Software

• clusfind
• k-means++
• depthTools
• UCI
• R

This page was built for publication: Initializing \(k\)-means clustering by bootstrap and data depth

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