A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
From MaRDI portal
Publication:3174072
zbMATH Open1222.62142MaRDI QIDQ3174072FDOQ3174072
Authors: Sanjoy Dasgupta, Leonard J. Schulman 
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v8/dasgupta07a.html
Recommendations
- Learning mixtures of separated nonspherical Gaussians
- Learning mixtures of arbitrary Gaussians
- Statistical convergence of the EM algorithm on Gaussian mixture models
- Efficiently learning mixtures of two Gaussians
- Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM
Cited In (14)
- Sketched learning for image denoising
- A method of spectral mixture analysis based on the Gaussian Markov random field model
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved convergence guarantees for learning Gaussian mixture models by EM and gradient EM
- A spectral algorithm for learning hidden Markov models
- Statistical convergence of the EM algorithm on Gaussian mixture models
- Title not available (Why is that?)
- A spectral algorithm for latent Dirichlet allocation
- Fundamental limits of low-rank matrix estimation with diverging aspect ratios
- Clustering subgaussian mixtures by semidefinite programming
- Learning polynomial transformations via generalized tensor decompositions
- How well do SEM algorithms imitate EM algorithms? A non-asymptotic analysis for mixture models
- Covariate Regularized Community Detection in Sparse Graphs
This page was built for publication: A probabilistic analysis of EM for mixtures of separated, spherical Gaussians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174072)
