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
General Framework for Meta‐Analysis of Haplotype Association Tests
Shuai Wang,Jing Hua Zhao,Ping An,Xiuqing Guo,Richard A. Jensen,Jonathan Marten,Jennifer E. Huffman,Karina Meidtner,Heiner Boeing,Archie Campbell,Kenneth Rice,Robert A. Scott,Jie Yao,Matthias B. Schulze,Nicholas J. Wareham,Ingrid B. Borecki,Michael A. Province,Jerome I. Rotter,Caroline Hayward,Caroline Hayward,Mark O. Goodarzi,James B. Meigs,Josée Dupuis,Josée Dupuis +23 more
TL;DR: This work proposes a two‐stage meta‐analysis approach to combine haplotype analysis results, and demonstrates that this approach is more powerful than inverse variance weighted meta‐ analysis of single SNV analysis when haplotype effects are present.
Posted ContentDOI
Using machine learning and big data to explore the drug resistance landscape in HIV
Luc Blassel,Luc Blassel,Anna Tostevin,Christian Julian Villabona-Arenas,Martine Peeters,Stéphane Hué,Olivier Gascuel +6 more
TL;DR: In this article, the authors used machine learning to discover new DRMs and study potential epistasis effects on the reverse transcriptase (RT) sequence dataset from the UK (n ≈ 55, 000), using all observed mutations as binary representation features.
Journal ArticleDOI
Weighted multiple testing procedures in genome-wide association studies
TL;DR: In this article , a new weighted multiple testing procedure called wBHa was proposed to detect rare variants with low minor allele frequencies while maximizing the overall detection power in the context of genome wide association studies (GWAS).
Journal ArticleDOI
Identifying Key Genes and Related Molecules as Potential Biomarkers in Human Dilated Cardiomyopathy by Comprehensive Bioinformatics Analysis
TL;DR: In this paper , the authors used weighted gene co-expression network analysis, differential expression analysis of genes, enriched analysis and LASSO model construction to predict the target miRNAs and circRNAs of hub genes, respectively.
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