Initializing \(k\)-means clustering by bootstrap and data depth
From MaRDI portal
Publication:2236768
DOI10.1007/s00357-020-09372-3OpenAlexW3045268955MaRDI QIDQ2236768
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
Related Items
Band depth based initialization of K-means for functional data clustering ⋮ Clustering directional data through depth functions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the added value of bootstrap analysis for \(K\)-means clustering
- The planar \(k\)-means problem is NP-hard
- 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
- On a notion of data depth based on random simplices
- Optimising \(k\)-means clustering results with standard software packages
- Cluster-wise assessment of cluster stability
- Descriptive statistics for multivariate distributions
- Clustering to minimize the maximum intercluster distance
- A central limit theorem for k-means clustering
- Adaptive initialization method based on spatial local information for \(k\)-means algorithm
- Clustering and classification based on the L\(_{1}\) data depth
- On strategies to fix degenerate \(k\)-means solutions
- Initializing \(K\)-means batch clustering: A critical evaluation of several techniques
- A variable-selection heuristic for K-means clustering
- Bootstrapping cluster analysis: Assessing the reliability of conclusions from microarray experiments
- K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
- Finding Groups in Data
- The multivariate L 1 -median and associated data depth
- On the Concept of Depth for Functional Data
