Genome-wide association analysis by lasso penalized logistic regression
TLDR
The performance of lasso penalized logistic regression in case-control disease gene mapping with a large number of SNPs (single nucleotide polymorphisms) predictors is evaluated and coeliac disease results replicate the previous SNP results and shed light on possible interactions among the SNPs.Abstract:
Motivation: In ordinary regression, imposition of a lasso penalty makes continuous model selection straightforward. Lasso penalized regression is particularly advantageous when the number of predictors far exceeds the number of observations.
Method: The present article evaluates the performance of lasso penalized logistic regression in case–control disease gene mapping with a large number of SNPs (single nucleotide polymorphisms) predictors. The strength of the lasso penalty can be tuned to select a predetermined number of the most relevant SNPs and other predictors. For a given value of the tuning constant, the penalized likelihood is quickly maximized by cyclic coordinate ascent. Once the most potent marginal predictors are identified, their two-way and higher order interactions can also be examined by lasso penalized logistic regression.
Results: This strategy is tested on both simulated and real data. Our findings on coeliac disease replicate the previous SNP results and shed light on possible interactions among the SNPs.
Availability: The software discussed is available in Mendel 9.0 at the UCLA Human Genetics web site.
Contact: klange@ucla.edu
Supplementary information: Supplementary data are available at Bioinformatics online.read more
Citations
More filters
Posted Content
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
Seyoung Kim,Eric P. Xing +1 more
TL;DR: In this paper, a tree-guided group lasso is proposed for estimating structured sparsity under multi-response regression by employing a novel penalty function constructed from the tree, and a systematic weighting scheme for the overlapping groups in the tree-penalty such that each regression coefficient is penalized in a balanced manner despite the inhomogeneous multiplicity of group memberships of the regression coefficients due to overlap among groups.
Journal ArticleDOI
Panning for gold: ‘model‐X’ knockoffs for high dimensional controlled variable selection
TL;DR: In this paper, the authors propose a new framework of "model-X" knockoffs, which reads from a different perspective the knockoff procedure that was originally designed for controlling the false discovery rate in linear models.
Journal ArticleDOI
Bayesian variable selection regression for genome-wide association studies and other large-scale problems
Yongtao Guan,Matthew Stephens +1 more
TL;DR: The authors apply Bayesian Variable Selection Regression (BVSR) to genome-wide association studies and similar large-scale regression problems, and demonstrate that BVSR can provide useful inferences in these large-size association studies.
Journal ArticleDOI
Evaluation of variable selection methods for random forests and omics data sets.
TL;DR: Vita is considerably faster than Boruta and thus more suitable for large data sets, but only Boruta can also be applied in low-dimensional settings, while Vita was the most robust approach under a pure null model without any predictor variables related to the outcome.
Journal ArticleDOI
Bayesian variable selection regression for genome-wide association studies and other large-scale problems
Yongtao Guan,Matthew Stephens +1 more
TL;DR: The potential for BVSR to estimate the total proportion of variance in outcome explained by relevant covariates is emphasized, to shed light on the issue of "missing heritability" in genome-wide association studies.
References
More filters
Journal ArticleDOI
Controlling the false discovery rate: a practical and powerful approach to multiple testing
Yoav Benjamini,Yosef Hochberg +1 more
TL;DR: In this paper, a different approach to problems of multiple significance testing is presented, which calls for controlling the expected proportion of falsely rejected hypotheses -the false discovery rate, which is equivalent to the FWER when all hypotheses are true but is smaller otherwise.
Journal ArticleDOI
Regression Shrinkage and Selection via the Lasso
TL;DR: A new method for estimation in linear models called the lasso, which minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than a constant, is proposed.
Journal ArticleDOI
Regularization Paths for Generalized Linear Models via Coordinate Descent
TL;DR: In comparative timings, the new algorithms are considerably faster than competing methods and can handle large problems and can also deal efficiently with sparse features.
Journal ArticleDOI
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
Journal ArticleDOI
An Iterative Thresholding Algorithm for Linear Inverse Problems with a Sparsity Constraint
TL;DR: It is proved that replacing the usual quadratic regularizing penalties by weighted 𝓁p‐penalized penalties on the coefficients of such expansions, with 1 ≤ p ≤ 2, still regularizes the problem.
Related Papers (5)
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Jianqing Fan,Runze Li +1 more