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
Journal ArticleDOI
Modeling gene-covariate interactions in sparse regression with group structure for genome-wide association studies.
TL;DR: A novel sparse regression methodology for gene-covariate models in association studies that not only allows such interactions but also considers biological group structure and results show that this method substantially outperforms another method, in which interaction is considered, but group structure is ignored.
Posted Content
Identifying Demand Effects in a Large Network of Product Categories
TL;DR: In this paper, a methodology to estimate a parsimonious product category network without prior constraints on its structure is presented, and sparse estimation of the Vector AutoRegressive Market Response Model is presented.
Proceedings ArticleDOI
Detection of SNP-SNP Interactions in Genome-wide Association Data Using Random Forests and Association Rules
Tung Nguyen,Ly Le +1 more
TL;DR: This paper proposes first to use an improvement of Random Forest algorithm tailored for structured GWAS data, all rules are then extracted from the trees to analyse SNPs interactions, and reduces the dimensionality and can perform well with high-dimensional SNPs data sets.
Dissertation
Parametric classification and variable selection by the minimum integrated squared error criterion
TL;DR: In this article, Parametric classification and variable selection by the Minimum Integrated Squared Error Criterion (MIQE) was used for parametric classification, variable selection and variable classification.
Journal ArticleDOI
Deep Feature Screening: Feature Selection for Ultra High-Dimensional Data via Deep Neural Networks
TL;DR: This approach combines the strengths of both deep neural networks and feature screening, and thereby has the following appealing features in addition to its ability of handling ultra high-dimensional data with small number of samples: it is model free and distribution free.
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