Initializing k-means clustering by bootstrap and data depth

DOI10.1007/S00357-020-09372-3OpenAlexW3045268955MaRDI QIDQ2236768FDOQ2236768

Juan Romo, Aurora Torrente

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finding Groups in Data
• The multivariate L ₁ -median and associated data depth
• On the Concept of Depth for Functional Data
• Clustering and classification based on the L\(_{1}\) data depth
• On a notion of data depth based on random simplices
• Descriptive statistics for multivariate distributions
• Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
• Optimising \(k\)-means clustering results with standard software packages
• Cluster-wise assessment of cluster stability
• Clustering to minimize the maximum intercluster distance
• A central limit theorem for k-means clustering
• On the added value of bootstrap analysis for \(K\)-means clustering
• The planar \(k\)-means problem is NP-hard
• Bootstrapping cluster analysis: Assessing the reliability of conclusions from microarray experi\-ments.
• A variable-selection heuristic for K-means clustering
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• 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
• Adaptive initialization method based on spatial local information for \(k\)-means algorithm
• On strategies to fix degenerate \(k\)-means solutions

Cited In (2)

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

Uses Software

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

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)