The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Markov Chain Monte Carlo Methods and the Label Switching Problem in Bayesian Mixture Modeling
Open accessAbstract
In the past ten years there has been a dramatic increase of interest in the Bayesian analysis of finite mixture models. This is primarily because of the emergence of Markov chain Monte Carlo (MCMC) methods. While MCMC provides a convenient way to draw inference from complicated statistical models, there are many, perhaps underappreciated, problems associated with the MCMC analysis of mixtures. The problems are mainly caused by the nonidentifiability of the components under symmetric priors, which leads to so-called label switching in the MCMC output. This means that ergodic averages of component specific quantities will be identical and thus useless for inference. We review the solutions to the label switching problem, such as artificial identifiability constraints, relabelling algorithms and label invariant loss functions. We also review various MCMC sampling schemes that have been suggested for mixture models and discuss posterior sensitivity to prior specification.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195 · cited 17×
“We begin by coding a Metropolis– Hastings algorithm without completing the data (if we can compute the marginal likelihood). We then seek to find the proposal densities and parameters that provide reasonable mixing (i.e., autocorrelations in the chain not too large). If the sampler is unable to move around the symmetr…”
BackgroundMethodInfluentialMcLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
Reversible jump Markov chain Monte Carlo computation and Bayesian model determination
GREEN, P. J. (1995) · Biometrika · doi:10.1093/biomet/82.4.711 · Cited by 5,930
Baum, L. E., Petrie, T., Soules, G., & Weiss, N. (1970) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177697196 · Cited by 4,297
Monte Carlo Statistical Methods
Robert, C. P., & Casella, G. (2004) · Springer Texts in Statistics · doi:10.1007/978-1-4757-4145-2 · Cited by 4,271
Markov Chains for Exploring Posterior Distributions
Tierney, L. (1994) · The Annals of Statistics · doi:10.1214/aos/1176325750 · Cited by 3,452
Statistical Analysis of Finite Mixture Distributions.
Lindsay, B. G., Titterington, D. M., Smith, A. F. M., & Makov, U. E. (1987) · Journal of the American Statistical Association · doi:10.2307/2289504 · Cited by 2,905
Statistical Inference for Probabilistic Functions of Finite State Markov Chains
Baum, L. E., & Petrie, T. (1966) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177699147 · Cited by 2,775
Monte Carlo Strategies in Scientific Computing
Liu, J. S. (2004) · Springer Series in Statistics · doi:10.1007/978-0-387-76371-2 · Cited by 2,690
Cited by
Jakobsson, M., & Rosenberg, N. A. (2007) · Bioinformatics · doi:10.1093/bioinformatics/btm233 · Cited by 6,290
Scientific discovery in the age of artificial intelligence.
Wang, H., Fu, T., Du, Y., Gao, W., Huang, K., Liu, Z., Chandak, P., Liu, S., Van Katwyk, P., Deac, A., et al. (2023) · Nature · doi:10.1038/s41586-023-06221-2 · Cited by 1,823
Sequential Monte Carlo Samplers
Del Moral, P., Doucet, A., & Jasra, A. (2006) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2006.00553.x · Cited by 1,239
Self-citationGao, H., Williamson, S., & Bustamante, C. D. (2007) · Genetics · doi:10.1534/genetics.107.072371 · Cited by 491
von Toussaint, U. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.943 · Cited by 422
pong: fast analysis and visualization of latent clusters in population genetic data
Behr, A. A., Liu, K. Z., Liu-Fang, G., Nakka, P., & Ramachandran, S. (2016) · Bioinformatics · doi:10.1093/bioinformatics/btw327 · Cited by 381
A General Framework for Updating Belief Distributions
Bissiri, P. G., Holmes, C. C., & Walker, S. G. (2016) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/rssb.12158 · Cited by 285
Self-citationMolecular Evolution: A Statistical Approach
Yang, Z. (2014) · doi:10.1093/acprof:oso/9780199602605.001.0001 · Cited by 273
Siégel, C., Bryan, S. E., Allen, C. M., & Gust, D. A. (2018) · Earth-Science Reviews · doi:10.1016/j.earscirev.2017.08.011 · Cited by 263
Engaging Voluntary Contributions in Online Communities: A Hidden Markov Model1
Chen, W., Wei, X., & Zhu, K. X. (2018) · MIS Quarterly · doi:10.25300/misq/2018/14196 · Cited by 173
Depaoli, S. (2013) · Psychological Methods · doi:10.1037/a0031609 · Cited by 147
Metadata
- Authors
- Jasra, A., Holmes, C. C., & Stephens, D. A.
- Venue
- Statistical Science
- Publisher
- Institute of Mathematical Statistics
- Published
- 2005-02-01
- Volume
- 20
- Issue
- 1
- Pages
- 50-67
- ISSN
- 0883-4237 (ISSN-L)
- OpenAlex
- W2035756456
- Cited by
- 670
- References
- 39
- FWCI
- 17.86
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.