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
Journal ArticleDOI

GWASinlps: non-local prior based iterative SNP selection tool for genome-wide association studies.

TL;DR: A variable selection method, named, iterative non‐local prior based selection for GWAS, or GWASinlps, that combines the computational efficiency of the screen‐and‐select approach based on some association learning and the parsimonious uncertainty quantification provided by the use of non‐ local priors in an iterative variable selection framework.
Journal ArticleDOI

EMLasso: logistic lasso with missing data.

TL;DR: In clinical settings, missing data in the covariates occur frequently and when this sort of data is used for model selection, the missingness is often resolved through a complete case analysis or a form of single imputation.
Journal ArticleDOI

A novel algorithm for simultaneous SNP selection in high-dimensional genome-wide association studies

TL;DR: A novel multivariate algorithm for large scale SNP selection using CAR score regression, a promising new approach for prioritizing biomarkers, that consistently outperforms all competing approaches, both uni- and multivariate, in terms of correctly recovered causal SNPs and SNP ranking.
Journal ArticleDOI

Quasi-Likelihood and/or Robust Estimation in High Dimensions

TL;DR: An extension of the oracle results to the case of quasi-likelihood loss is presented, and bounds for the prediction error and $\ell_1$-error are proved and it is shown that under an irrepresentable condition, the $\ell-1 $-penalized quasi- likelihood estimator has no false positives.
Journal ArticleDOI

Dysregulated plasma lipid mediator profiles in critically ill COVID-19 patients.

TL;DR: In this paper, the plasma from COVID-19 patients with either severe disease and those that were critically ill was collected and lipid mediator profiles were determined using liquid chromatography tandem mass spectrometry.
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)