Robust Bregman clustering
From MaRDI portal
Publication:820825
DOI10.1214/20-AOS2018zbMath1475.62177arXiv1812.04356MaRDI QIDQ820825
Aurélie Fischer, Claire Brécheteau, Clément Levrard
Publication date: 28 September 2021
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04356
Nonparametric robustness (62G35) Classification and discrimination; cluster analysis (statistical aspects) (62H30)
Related Items (2)
Topics in robust statistical learning ⋮ Robust \(k\)-means clustering for distributions with two moments
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient and fast estimation of the geometric median in Hilbert spaces with an averaged stochastic gradient algorithm
- Geometric inference for probability measures
- Empirical risk minimization for heavy-tailed losses
- A general trimming approach to robust cluster analysis
- Quantization and clustering with Bregman divergences
- Best approximations to random variables based on trimming procedures
- A note on the breakdown point of the least median of squares and least trimmed squares estimators
- Trimmed \(k\)-means: An attempt to robustify quantizers
- Robust machine learning by median-of-means: theory and practice
- Nonasymptotic bounds for vector quantization in Hilbert spaces
- Distortion measures for speech processing
- On the Optimality of Conditional Expectation as a Bregman Predictor
- On the Performance of Clustering in Hilbert Spaces
- Quantization/clustering: when and why does k-means work?
- Least squares quantization in PCM
- 10.1162/153244303321897735
- Persistence-Based Clustering in Riemannian Manifolds
- Robust Statistics
- Prediction, Learning, and Games
- Convex Analysis
This page was built for publication: Robust Bregman clustering
