On the convergence rate of random permutation sampler and ECR algorithm in missing data models
From MaRDI portal
(Redirected from Publication:352882)
Recommendations
- On the rate of convergence of the ECM algorithm
- The ECME algorithm: A simple extension of EM and ECM with faster monotone convergence
- The S-U algorithm for missing data problems
- Interpretation and inference in mixture models: simple MCMC works
- On convergence properties of the Monte Carlo EM algorithm
Cites work
- scientific article; zbMATH DE number 3567782 (Why is no real title available?)
- scientific article; zbMATH DE number 1085980 (Why is no real title available?)
- Bayesian Inference in Hidden Markov Models Through the Reversible Jump Markov Chain Monte Carlo Method
- Computational and Inferential Difficulties with Mixture Posterior Distributions
- Dealing With Label Switching in Mixture Models
- Finite mixture and Markov switching models.
- Inference in hidden Markov models.
- Markov Chains
- Markov chain Monte Carlo Estimation of Classical and Dynamic Switching and Mixture Models
- Markov chain Monte Carlo methods and the label switching problem in Bayesian mixture modeling
- Mixture Densities, Maximum Likelihood and the EM Algorithm
- Sampling-Based Approaches to Calculating Marginal Densities
Cited in
(4)- Handling the label switching problem in latent class models via the ECR algorithm
- Clustering multivariate data using factor analytic Bayesian mixtures with an unknown number of components
- Overfitting Bayesian mixtures of factor analyzers with an unknown number of components
- An alternative class of models to position social network groups in latent spaces
This page was built for publication: On the convergence rate of random permutation sampler and ECR algorithm in missing data models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352882)