Minimizing variable selection criteria by Markov chain Monte Carlo
From MaRDI portal
Publication:333351
DOI10.1007/S00180-016-0649-3zbMATH Open1348.65018OpenAlexW2296001064MaRDI QIDQ333351FDOQ333351
Authors: Yen-Shiu Chin, Ting-Li Chen
Publication date: 28 October 2016
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00180-016-0649-3
Recommendations
Computational methods for problems pertaining to statistics (62-08) Nonparametric regression and quantile regression (62G08) Linear regression; mixed models (62J05)
Cites Work
- Estimating the dimension of a model
- The Adaptive Lasso and Its Oracle Properties
- Least angle regression. (With discussion)
- Title not available (Why is that?)
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
- Title not available (Why is that?)
- Some Comments on C P
- A new look at the statistical model identification
- Optimization by simulated annealing
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Sparsity and Smoothness Via the Fused Lasso
- Regularization and Variable Selection Via the Elastic Net
- Model Selection and Estimation in Regression with Grouped Variables
- Nonparametric regression using Bayesian variable selection
- Nonparametric Bayesian data analysis
- Adaptive Lasso for sparse high-dimensional regression models
- Mixtures of g Priors for Bayesian Variable Selection
- Title not available (Why is that?)
- Title not available (Why is that?)
- Better Subset Regression Using the Nonnegative Garrote
- Title not available (Why is that?)
- Exploration, normalization, and summaries of high density oligonucleotide array probe level data
Cited In (2)
This page was built for publication: Minimizing variable selection criteria by Markov chain Monte Carlo
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q333351)