Bayesian methods for variable selection and model choice have become increasingly popular in recent years, due to advances in Markov chain Monte Carlo (MCMC) computational algorithms. Several methods have been proposed in literature in the case of linear and generalized linear models. In this paper we adapt some of the most popular algorithms to a class of non-linear and non-Gaussian time series models, i.e. the Markov mixture models (MMM). We also propose the ``Metropolization'' of the algorithm of Kuo and Mallick (1998), in order to tackle variable selection efficiently, both when the complexity of the model is high, as in MMM, and when the exogenous variables are strongly correlated. Numerical comparisons among the competing MCMC algorithms are also presented via simulation examples.
|Numero di pagine||23|
|Rivista||COMMUNICATIONS IN STATISTICS. SIMULATION AND COMPUTATION|
|Stato di pubblicazione||Pubblicato - 2008|
- Gibbs variable selection
- Kuo-Mallick method
- Metropolized-Kuo-Mallick method
- Stochastic search variable selection