K-bMOM: A robust Lloyd-type clustering algorithm based on bootstrap median-of-means
From MaRDI portal
Publication:2072412
DOI10.1016/j.csda.2021.107370OpenAlexW3205182098MaRDI QIDQ2072412
Edouard Genetay, Adrien Saumard, Camille Brunet-Saumard
Publication date: 26 January 2022
Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.03899
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Estimating the Number of Clusters in a Data Set Via the Gap Statistic
- Algorithm AS 136: A K-Means Clustering Algorithm
- Sub-Gaussian mean estimators
- Slope heuristics: overview and implementation
- A general trimming approach to robust cluster analysis
- Random generation of combinatorial structures from a uniform distribution
- The space complexity of approximating the frequency moments
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Sub-Gaussian estimators of the mean of a random vector
- Learning from MOM's principles: Le Cam's approach
- Robust machine learning by median-of-means: theory and practice
- Risk minimization by median-of-means tournaments
- The breakdown point of the median of means tournament
- Mean estimation and regression under heavy-tailed distributions: A survey
- Robust clustering tools based on optimal transportation
- A review of robust clustering methods
- Robustness Properties of k Means and Trimmed k Means
- Robust Statistics
- Robust Statistics