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
Book

Sparse Learning Under Regularization Framework

TL;DR: This thesis develops a novel online learning framework to solve group lasso and multi-task feature selection and proposes a generalized MKL (GMKL) model by introducing an elastic net-type constraint on the kernel weights to seek the optimal kernel combination weights.
Journal ArticleDOI

A mutation-based gene set predicts survival benefit after immunotherapy across multiple cancers and reveals the immune response landscape

TL;DR: In this paper , a comprehensive mutation-based gene set across different tumor types was established to predict the efficacy of immunotherapy therapy, which can be used to reliably predict survival benefit across cancers in patients receiving ICI therapy.
Posted Content

The Kernel Interaction Trick: Fast Bayesian Discovery of Pairwise Interactions in High Dimensions

TL;DR: In this paper, the authors propose a Gaussian process representation of the posterior with a vector of O(p) kernel hyper-parameters, which can be used to discover pairwise interactions.
Journal ArticleDOI

Controlling the local false discovery rate in the adaptive Lasso

TL;DR: The concept of local false discovery rates (lFDRs) is adapted so that it applies to the sequence of smoothing parameters for the adaptive Lasso, and the lFDR for a given λn is defined to be the probability that the variable added to the model by decreasingδ is not associated with the outcome, where δ is a small value.
Journal ArticleDOI

Polygenic approaches to detect gene-environment interactions when external information is unavailable.

TL;DR: This work provides guidance to choose a polygenic approach to detect G × E when external information is unavailable, by comparing the ADABF with the GRS based on marginal effects of SNPs (GRS-M) and GRS-I based on SNP × E interactions (G RS-I).
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)