Genome-wide association analysis by lasso penalized logistic regression
Top Cited Papers
- 28 January 2009
- journal article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 25 (6) , 714-721
- https://doi.org/10.1093/bioinformatics/btp041
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.eduSupplementary information: Supplementary data are available at Bioinformatics online.Keywords
This publication has 24 references indexed in Scilit:
- Penalized estimation of haplotype frequenciesBioinformatics, 2008
- Pathwise coordinate optimizationThe Annals of Applied Statistics, 2007
- A tutorial on statistical methods for population association studiesNature Reviews Genetics, 2006
- A Fast Method for Computing High-Significance Disease Association in Large Population-Based StudiesAmerican Journal of Human Genetics, 2006
- Identifying interacting SNPs using Monte Carlo logic regressionGenetic Epidemiology, 2004
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraintCommunications on Pure and Applied Mathematics, 2004
- OptimizationPublished by Springer Nature ,2004
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingJournal of the Royal Statistical Society Series B: Statistical Methodology, 1995
- ROBUST MODELING WITH ERRATIC DATAGeophysics, 1973