Probabilistic relabelling strategies for the label switching problem in Bayesian mixture models.

Sperrin, Matthew and Jaki, Thomas and Wit, Ernst (2010) Probabilistic relabelling strategies for the label switching problem in Bayesian mixture models. Statistics and Computing, 20 (3). pp. 357-366. ISSN 0960-3174

This is the latest version of this item.

[img]
Preview
PDF (labels-sc-techrep-apr09.pdf)
labels-sc-techrep-apr09.pdf

Download (192kB)

Abstract

The label switching problem is caused by the likelihood of a Bayesian mixture model being invariant to permutations of the labels. The permutation can change multiple times between Markov Chain Monte Carlo (MCMC) iterations making it difficult to infer component-specific parameters of the model. Various so-called ‘relabelling’ strategies exist with the goal to ‘undo’ the label switches that have occurred to enable estimation of functions that depend on component-specific parameters. Most existing approaches rely upon specifying a loss function, and relabelling by minimising its posterior expected loss. In this paper we develop probabilistic approaches to relabelling that allow estimation and incorporation of the uncertainty in the relabelling process. Variants of the probabilistic relabelling algorithm are introduced and compared to existing loss function based methods. We demonstrate that the idea of probabilistic relabelling can be expressed in a rigorous framework based on the EM algorithm.

Item Type: Journal Article
Journal or Publication Title: Statistics and Computing
Uncontrolled Keywords: /dk/atira/pure/researchoutput/libraryofcongress/qa
Subjects:
Departments: Faculty of Science and Technology > Mathematics and Statistics
ID Code: 26391
Deposited By: Mr Matthew Sperrin
Deposited On: 08 May 2009 12:21
Refereed?: Yes
Published?: Published
Last Modified: 16 Sep 2019 00:24
URI: https://eprints.lancs.ac.uk/id/eprint/26391

Available Versions of this Item

Actions (login required)

View Item View Item