Volume 1 Supplement 1
Logistic regression trees for initial selection of interesting loci in case-control studies
© Nickolov and Milanov; licensee BioMed Central Ltd. 2007
Published: 18 December 2007
Modern genetic epidemiology faces the challenge of dealing with hundreds of thousands of genetic markers. The selection of a small initial subset of interesting markers for further investigation can greatly facilitate genetic studies. In this contribution we suggest the use of a logistic regression tree algorithm known as logistic tree with unbiased selection. Using the simulated data provided for Genetic Analysis Workshop 15, we show how this algorithm, with incorporation of multifactor dimensionality reduction method, can reduce an initial large pool of markers to a small set that includes the interesting markers with high probability.
One of the goals of genetic epidemiology is to identify genetic polymorphisms involved in the development of common diseases. Statistical methods for analyzing the relationship between a large number of candidate genetic loci and disease-related variables have been developed in genetic association studies. Studying complex diseases by means of single-locus methods may not be appropriate in the case of small main effects . Methods to address these limitations have been developed. Multi-locus methods are specifically designed to find multiple disease loci that may influence the disease by intricate genetic patterns, gene × gene interaction and gene × environment interactions. These methods frequently find the best multilocus predictor using an exhaustive search, which makes it inapplicable to a large number of predictors.
To address this and other limitations, a flexible computational framework for detecting and interpreting gene × gene interactions has recently been proposed . In its first step, entropy-based measures of information gain are used to select interesting predictors from the pool of possible thousands of candidates, a set of single-nucleotide polymorphisms (SNPs).
In this contribution, we present a method that could be used in the first step of the above-mentioned framework. We propose to use the LOTUS (logistic tree with unbiased selection) algorithm by Chan and Loh [3, 4] in the initial selection of interesting predictors.
In our study of the utility of LOTUS for selecting a small number of interesting SNPs, we used simulated data from Genetic Analysis Workshop 15 (GAW15, Problem 3), with knowledge of the true model and simulation parameters used to generate the data.
We show that with LOTUS alone, and with incorporation of multifactor dimensionality reduction method (MDR) , an initial large set of SNPs can be reduced to a small set that includes the interesting markers with high probability.
The data set used was the GAW15 simulated rheumatoid arthritis (RA) data. We chose disease status for RA as the phenotype of interest. We used 50 replications of SNP data to create 50 samples of 1000 cases and 1000 controls. We created the cases by randomly sampling one affected member of each simulated family.
We did our analyses knowing the full model and simulation parameters used to generate the data. To explore the ability of LOTUS for selecting important predictors, we used some of the trait loci from the answers. For each sample, an initial set of 309 SNPs were considered, 303 of which were the simulated SNPs on chromosome 18. The rest were the trait loci A, B, C, D, E, and F. We used sample sizes of 250, 500, and 1000 cases (controls), respectively.
We also considered, as a more realistic scenario, the 303 SNPs of chromosome 18 only (trait locus E excluded). The sample size was 1000.
To estimate the false-positive rate, that is the probability of selecting a SNP not at causative locus, we used 4 of the 303 SNPs on chromosome 18.
LOTUS (logistic tree with unbiased selection) is a method for automatic construction of logistic regression trees. LOTUS fits a piecewise (multiple or simple) linear logistic regression model by recursively partitioning the data and fitting a different logistic regression in each partition. This allows nonlinear features of the data to be modeled without requiring variable transformations. A few features make LOTUS especially appropriate for analysis and interpretation of large data sets: negligible bias in split variable selection, relatively fast training speed, applicability to quantitative and categorical variables, choice of multiple or simple linear logistic node models, and suitability for data sets with missing values.
LOTUS constructs logistic regression trees in a top-down fashion [3, 4, 6]. It deals with the selection bias problem due to some predictors taking more values than others, and distinguishes nonlinear from linear effects through the use of a Cochran-Armitage trend-adjusted chi-square test. It can fit either a multiple or simple logistic regression at each node. Once the initial tree is grown, it is pruned back using a pruning method similar to the classification and regression trees (CART) algorithm . LOTUS uses deviance as the 'cost-complexity measure' instead of the sum of squared residuals. The tree with the lowest prediction deviance is chosen based on an independent test set or ten-fold cross-validation.
LOTUS allows the choice of one of three roles for each quantitative predictor variable: f-variable, for fitting only; s-variable, for splitting only; and n-variable for both splitting and fitting. In our application we treated each locus genotype as an n-variable. We fitted a multiple stepwise linear logistic regression tree. A p-value of 0.05 was used for forward selection and backward elimination. The maximum number of predictor variables to be selected at each node was chosen to be ten.
The LOTUS computer program is freely available .
MDR is a nonparametric, combinatorial, model-free data-mining method, which has been successful in identifying gene × gene interactions in a balanced case-control design. With MDR, multilocus genotypes are pooled into high-risk and low-risk groups, thereby reducing the dimensionality of the genotype predictors from high dimensions to one dimension. That is, MDR employs constructive induction , the process of defining a new predictor as a function of two or more other predictors. The new one-dimensional multilocus-genotype predictor is used to choose the best set of loci from each one- to L-locus set according to classification and prediction errors. The MDR algorithm has reasonable power to detect epistasis .
Selection of interesting SNPs
We studied two procedures for selecting a small set of interesting SNPs from an initial large set. In the first procedure we simply selected all SNPs in the final tree produced by LOTUS. However, if one selects as interesting only the SNPs in the final regression tree produced by LOTUS, some of the important SNPs, and possibly trait loci, might not be selected. Their effect might have been overlooked due to the strong effect of some of the selected loci, higher order interactions, or the parameter settings of the algorithm such as maximum number of predictors at each node. To address this, we incorporated MDR in our second selection procedure. We used MDR to select the best model among all possible one- to four-locus subsets of the predictor set selected by LOTUS. The markers in this best model were then removed from the initial set of SNPs and LOTUS was run again. The markers selected at the first and second runs of LOTUS constitute the final set of interesting SNPs.
Our second procedure may lead to a larger final set of interesting SNPs and thereby increased false-positive rate. However, the incorporation of MDR might improve the selection of important SNPs. Our goal is not to miss markers possibly involved in disease etiology. Although the proposed procedures are for initial selection and the false-positive rate is not of major concern, to keep it reasonably low we use at most two LOTUS runs.
LOTUS can process many thousands of predictors at one run. However, due to the computational limitations of MDR, we considered only hundreds of SNPs in our simulations, and chose the parameters of LOTUS accordingly.
Selection rates for individual trait loci; 50 replications
Selection rate (%)
Next, we considered chromosome 18 SNPs only: 303 SNPs, excluding the trait locus E. The sample size was 1000. SNP-269 that is physically closest to the trait locus E (and possibly in high linkage disequilibrium with it) was selected 92% of the time by the first procedure and 98% of the time by the second procedure. In the cases when SNP-269 was not selected by the first procedure, the set of interesting SNPs included SNP-268, which is also flanking the trait locus E.
False positive rates for individual loci; 50 replications
False positive rate (%)
Our analysis of the GAW15 simulated data demonstrates the usefulness of the logistic tree with unbiased selection algorithm (LOTUS) [3, 4] for reducing the number of SNPs in a case-control study by selecting a small number of interesting SNPs from among a large number of candidate loci. This algorithm may be used in the first step of the computational framework proposed by Moore et al.  or in any other multi-stage procedure. Applying LOTUS to a set of 309 SNPs (6 of them trait loci), we found that the trait loci were selected in the set of interesting SNPs with a high rate when either the loci effect or the sample size is large.
We want to point out that in most of our simulations LOTUS finished with a trivial tree, and the number of SNPs selected as interesting was less than 20. If the initial set is very large, one can increase the number of maximum predictor variables to be selected at each node.
In our study we included only genetic markers as predictors. However, LOTUS can use any categorical (gender, smoking status, etc.) or quantitative predictors, which may improve the selection process. This is the object of our future studies.
This article has been published as part of BMC Proceedings Volume 1 Supplement 1, 2007: Genetic Analysis Workshop 15: Gene Expression Analysis and Approaches to Detecting Multiple Functional Loci. The full contents of the supplement are available online at http://www.biomedcentral.com/1753-6561/1?issue=S1.
- Culverhouse R, Suarez B, Lin J, Reich T: A perspective on epistasis: limits of models displaying no main effect. Am J Hum Genet. 2002, 70: 461-471.View ArticlePubMed CentralPubMedGoogle Scholar
- Moore J, Gilbert J, Tsai C, Chiang F, Holden T, Barney N, White B: A flexible computational framework for detecting, characterizing, and interpreting statistical patterns of epistasis in genetic studies of human disease susceptibility. J Theor Biol. 2006, 241: 252-261.View ArticlePubMedGoogle Scholar
- Chan K, Loh W: LOTUS: An algorithm for building accurate and comprehensible logistic regression trees. J Comput Graph Stat. 2004, 13: 826-852.View ArticleGoogle Scholar
- Loh W: Logistic regression tree analysis. Springer Handbook of Engineering Statistics. Edited by: Pham H. 2006, London: Springer, 537-551.View ArticleGoogle Scholar
- Ritchie M, Hahn L, Roodi N, Bailey L, Dupont W, Parl F, Moore J: Multifactor dimensionality reduction reveals high-order interactions among estrogen metabolism genes in sporadic cancer. Am J Hum Genet. 2001, 69: 138-147.View ArticlePubMed CentralPubMedGoogle Scholar
- Landwehr N, Hall M, Frank E: Logistic model trees. Mach Learn. 2004, 59: 161-205.View ArticleGoogle Scholar
- Breiman L, Friedman H, Olshen J, Stone C: Classification and Regression Trees. 1984, Belmont, CA: WadsworthGoogle Scholar
- LOTUS Computer Program. [http://www.stat.wisc.edu/~kinyee/lotus.html]
- Michalski R: A theory and methodology of inductive learning. Artif Intell. 1983, 20: 111-161.View ArticleGoogle Scholar
- Ritchie M, Hahn L, Moore J: Power of multifactor dimensionality reduction for detecting gene-gene interactions in the presence of genotyping error, missing data, phenocopy, and genetic heterogeneity. Genet Epidemiol. 2003, 24: 150-157.View ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.