Skip Navigation



Biostatistics Advance Access published online on April 11, 2007
Biostatistics, doi:10.1093/biostatistics/kxm010
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (PDF) Freely available
Right arrow All Versions of this Article:
9/1/30    most recent
kxm010v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Right arrow Disclaimer
Google Scholar
Right arrow Articles by Park, M. Y.
Right arrow Articles by Hastie, T.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Park, M. Y.
Right arrow Articles by Hastie, T.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2007. Published by Oxford University Press. All rights reserved. For permissions, please e-mail: journals.permissions@oxfordjournals.org.

Penalized logistic regression for detecting gene interactions

Mee Young Park*

Google Inc., 1600 Amphitheatre Parkway, Mountain View, CA 94043, USA meeyoung{at}google.com

Trevor Hastie

Department of Statistics and Department of Health Research & Policy, Stanford University, Stanford, CA 94305, USA

* To whom correspondence should be addressed.

We propose using a variant of logistic regression (LR) with Formula-regularization to fit gene–gene and gene–environment interaction models. Studies have shown that many common diseases are influenced by interaction of certain genes. LR models with quadratic penalization not only correctly characterizes the influential genes along with their interaction structures but also yields additional benefits in handling high-dimensional, discrete factors with a binary response. We illustrate the advantages of using an Formula-regularization scheme and compare its performance with that of "multifactor dimensionality reduction" and "FlexTree," 2 recent tools for identifying gene–gene interactions. Through simulated and real data sets, we demonstrate that our method outperforms other methods in the identification of the interaction structures as well as prediction accuracy. In addition, we validate the significance of the factors selected through bootstrap analyses.

Keywords: Discrete factors; Gene interactions; High dimensional; Logistic regression; L2-regularization

Received May 26, 2006; revised February 6, 2007; accepted for publication March 2, 2007.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 BioinformaticsHome page
T. T. Wu, Y. F. Chen, T. Hastie, E. Sobel, and K. Lange
Genome-wide association analysis by lasso penalized logistic regression
Bioinformatics, March 15, 2009; 25(6): 714 - 721.
[Abstract] [Full Text] [PDF]

Home page
 BioinformaticsHome page
C. Yang, Z. He, X. Wan, Q. Yang, H. Xue, and W. Yu
SNPHarvester: a filtering-based approach for detecting epistatic interactions in genome-wide association studies
Bioinformatics, February 15, 2009; 25(4): 504 - 511.
[Abstract] [Full Text] [PDF]

Home page
 Hum Mol GenetHome page
V. B. Guzman, A. Yambartsev, A. Goncalves-Primo, I. D.C.G. Silva, C. R.N. Carvalho, J. C.L. Ribalta, L. R. Goulart, N. Shulzhenko, M. Gerbase-DeLima, and A. Morgun
New approach reveals CD28 and IFNG gene interaction in the susceptibility to cervical cancer
Hum. Mol. Genet., June 15, 2008; 17(12): 1838 - 1844.
[Abstract] [Full Text] [PDF]


Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.