Yao, WeixinLi, Longhai2014-03-102014-03-102014-03-10http://hdl.handle.net/2097/17211Solving label switching is crucial for interpreting the results of fitting Bayesian mixture models. The label switching originates from the invariance of posterior distribution to permutation of component labels. As a result, the component labels in Markov chain simulation may switch to another equivalent permutation, and the marginal posterior distribution associated with all labels may be similar and useless for inferring quantities relating to each individual component. In this article, we propose a new simple labelling method by minimizing the deviance of the class probabilities to a fixed reference labels. The reference labels can be chosen before running Markov chain Monte Carlo (MCMC) using optimization methods, such as expectation-maximization algorithms, and therefore the new labelling method can be implemented by an online algorithm, which can reduce the storage requirements and save much computation time. Using the Acid data set and Galaxy data set, we demonstrate the success of the proposed labelling method for removing the labelling switching in the raw MCMC samples.en-USThis is an electronic version of an article published in Journal of Statistical Computation and Simulation, 84(2), 310-323. Journal of Statistical Computation and Simulation is available online at: http://www.tandfonline.com/doi/full/10.1080/00949655.2012.707201#.Uxo0vj9dXL8Bayesian mixturesLabel switchingMarkov chain Monte CarloMixture modelsRelabelingArticle (author version)