Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R

DOI10.1007/s10994-015-5534-8zbMath1406.62142OpenAlexW2263386644MaRDI QIDQ506436

Wellington Cabrera, David Sergio Matusevich, Carlos R. Ordóñez

Publication date: 31 January 2017

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-015-5534-8

zbMATH Keywords

linear regressionvariable selectionMCMCgenomicsarray DBMS

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Applications of statistics to biology and medical sciences; meta analysis (62P10) Protein sequences, DNA sequences (92D20)

Related Items (1)

Bayesian Approaches to Shrinkage and Sparse Estimation

Uses Software

• LAPACK
• R
• SciDB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• High-dimensional variable selection
• Application of the alternating direction method of multipliers to separable convex programming problems
• Least angle regression. (With discussion)
• Sufficient burn-in for Gibbs samplers for a hierarchical random effects model.
• High-dimensional graphs and variable selection with the Lasso
• Greed is Good: Algorithmic Results for Sparse Approximation
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Mixtures of g Priors for Bayesian Variable Selection
• Bayesian Variable Selection in Linear Regression
• A Biometrics Invited Paper. The Analysis and Selection of Variables in Linear Regression
• The Variable Selection Problem
• Sure Independence Screening for Ultrahigh Dimensional Feature Space
• 10.1162/153244303322753616
• Sparse Approximate Solutions to Linear Systems
• Consistent High-Dimensional Bayesian Variable Selection via Penalized Credible Regions
• Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R