Bayesian Model Choice Via Markov Chain Monte Carlo Methods

Journal of the Royal Statistical Society: Series B (Statistical Methodology) · 1995 · Volume 57 · Issue 3

DOI: 10.1111/j.2517-6161.1995.tb02042.x

Abstract

Markov chain Monte Carlo (MCMC) integration methods enable the fitting of models of virtually unlimited complexity, and as such have revolutionized the practice of Bayesian data analysis. However, comparison across models may not proceed in a completely analogous fashion, owing to violations of the conditions sufficient to ensure convergence of the Markov chain. In this paper we present a framework for Bayesian model choice, along with an MCMC algorithm that does not suffer from convergence difficulties. Our algorithm applies equally well to problems where only one model is contemplated but its proper size is not known at the outset, such as problems involving integer-valued parameters, multiple changepoints or finite mixture distributions. We illustrate our approach with two published examples.

Keywords

bayes factor, finite mixture model, gibbs sampler, integer-valued parameters, models of varying size, multiple changepoint model, non-nested models

Enable JavaScript for citation tools and additional paper interactions.