PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Bayesian solutions to the label switching problem
Kai Puolamäki and Samuel Kaski
Advances in Intelligent Data Analysis VIII pp. 381-392, 2009.


The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC sampling difficult. We introduce a fully Bayesian treatment of the permutations which performs better than alternatives. The method can even be used to compute summaries of the posterior samples for nonparametric Bayesian methods, for which no good solutions exist so far. Although being approximative in that case, the results are very promising. The summaries are intuitively appealing: A summarized cluster is defined as a set of points for which the likelihood of being in the same cluster is maximized

EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Theory & Algorithms
ID Code:6266
Deposited By:Kai Puolamäki
Deposited On:08 March 2010