Accelerating EM for large databases
From MaRDI portal
Recommendations
Cited in
(18)- Classification of large data sets with mixture models via sufficient EM
- Estimating random-intercept models on data streams
- Speeding up the EM algorithm for mixture model-based segmentation of magnetic resonance images
- Data compression by volume prototypes for streaming data
- Estimating multilevel models on data streams
- Use of EM algorithm for data reduction under sparsity assumption
- Speed-up for the expectation-maximization algorithm for clustering categorical data
- Scalable probabilistic clustering
- Convergence analysis of an accelerated expectation-maximization algorithm for ill-posed integral equations
- An Asynchronous Distributed Expectation Maximization Algorithm for Massive Data: The DEM Algorithm
- scientific article; zbMATH DE number 5124739 (Why is no real title available?)
- AN ACCELERATED ALGORITHM FOR DENSITY ESTIMATION IN LARGE DATABASES USING GAUSSIAN MIXTURES
- On Casting Random-Effects Models in a Survival Framework
- scientific article; zbMATH DE number 1149453 (Why is no real title available?)
- scientific article; zbMATH DE number 2079485 (Why is no real title available?)
- 10.1162/153244302760200678
- Convergence analysis of the loping OS-EM algorithm for noisy data
- Variance-Reduced Stochastic Optimization for Efficient Inference of Hidden Markov Models
This page was built for publication: Accelerating EM for large databases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959949)
