Lamnisos, Demetris and Griffin, Jim E. and Steel, Mark F.J. (2009) Transdimensional Sampling Algorithms for Bayesian Variable Selection in Classification Problems With Many More Variables Than Observations. Journal of Computational and Graphical Statistics, 18 (3). pp. 592-612. ISSN 1061-8600. (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided)
Model search in probit regression is often conducted by simultaneously exploring the model and parameter space, using a reversible jump MCMC sampler. Standard samplers often have low model acceptance probabilities when there are many more regressors than observations. Implementing recent suggestions in the literature leads to much higher acceptance rates. However, high acceptance rates are often associated with poor mixing of chains. Thus, we design a more general model proposal that allows us to propose models “further” from our current model. This proposal can be tuned to achieve a suitable acceptance rate for good mixing. The effectiveness of this proposal is linked to the form of the marginalization scheme when updating the model and we propose a new efficient implementation of the automatic generic transdimensional algorithm of Green (2003). We also implement other previously proposed samplers and compare the efficiency of all methods on some gene expression datasets. Finally, the results of these applications lead us to propose guidelines for choosing between samplers. Relevant code and datasets are posted as an online supplement.
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA276 Mathematical statistics|
|Divisions:||Faculties > Science Technology and Medical Studies > School of Mathematics Statistics and Actuarial Science > Statistics|
|Depositing User:||Jim Griffin|
|Date Deposited:||25 Sep 2009 09:30|
|Last Modified:||21 May 2014 11:26|
|Resource URI:||https://kar.kent.ac.uk/id/eprint/22842 (The current URI for this page, for reference purposes)|