This article considers Bayesian variable selection problems for binary responses via stochastic search variable selection and Bayesian Lasso. To avoid matrix inversion in the corresponding Markov chain Monte Carlo implementations, the componentwise Gibbs sampler (CGS) idea is adopted. Moreover, we also propose automatic hyperparameter tuning rules for the proposed approaches. Simulation studies and a real example are used to demonstrate the performances of the proposed approaches. These results show that CGS approaches do not only have good performances in variable selection but also have the lower batch mean standard error values than those of original methods, especially for large number of covariates.
|Number of pages||15|
|Journal||Communications in Statistics: Simulation and Computation|
|Publication status||Published - 2016 Sep 13|
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Modelling and Simulation