scispace - formally typeset
Open AccessJournal ArticleDOI

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

Content maybe subject to copyright    Report

Citations
More filters
Posted Content

Tuning Parameter Calibration in High-dimensional Logistic Regression With Theoretical Guarantees

Wei Li, +1 more
- 01 Oct 2016 - 
TL;DR: A novel calibration scheme for penalized logistic regression is introduced, based on simple tests along the tuning parameter path and satisfies optimal finite sample bounds, and is amenable to easy and efficient implementations.
Journal ArticleDOI

Detecting disease-related SNP loci based on GSP

TL;DR: GSP method provides a new idea for the identification of pathogenicity loci and can detect all disease-related SNP loci of simulation data and Genetic Disease A and three of the four disease- related SNP locu of Age-related Macular Degeneration with excellent performance.
Posted Content

Sparse Network Lasso for Local High-dimensional Regression.

TL;DR: A simple yet efficient iterative least-squares based optimization procedure for the sparse network lasso is proposed, which does not need a tuning parameter, and is guaranteed to converge to a globally optimal solution.

Essays in problems in sequential decisions and large-scale randomized algorithms

Peichao Peng
TL;DR: Using nanofiltration membranes for the recovery of phosphorous with a second type of technology for the separation of nitrogen and carbon dioxide is a viable process and can be beneficial for both the recovery and the environment.
DissertationDOI

Evaluating and improving corn nitrogen fertilizer recommendation tools across the U.S. Midwest

TL;DR: In this article, the performance of publicly-available N fertilizer recommendation tools across a wide range of soil and weather environments for 1) prescribing EONR for planting and split N fertilizer applications, and 2) improve understanding of the economic and environmental impact of these tools.
References
More filters
Journal ArticleDOI

Controlling the false discovery rate: a practical and powerful approach to multiple testing

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)