Upper bound estimations of misclassification rate in the heteroscedastic clustering model with sub-Gaussian noises
From MaRDI portal
Publication:6548739
DOI10.1002/STA4.505MaRDI QIDQ6548739
Publication date: 3 June 2024
Published in: Stat (Search for Journal in Brave)
Cites Work
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics
- Robust \(k\)-means clustering for distributions with two moments
- Heteroskedastic PCA: algorithm, optimality, and applications
- On the non-asymptotic concentration of heteroskedastic Wishart-type matrix
- High-Dimensional Probability
- Cutoff for Exact Recovery of Gaussian Mixture Models
- Fast classification rates without standard margin assumptions
- Perturbation upper bounds for singular subspaces with a kind of heteroskedastic noise and its application in clustering
- On the uniform concentration bounds and large sample properties of clustering with Bregman divergences
This page was built for publication: Upper bound estimations of misclassification rate in the heteroscedastic clustering model with sub-Gaussian noises
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548739)