- Journal List
- BMC Proc
- v.1(Suppl 1); 2007
- PMC2367609

# Two-stage approach for identifying single-nucleotide polymorphisms associated with rheumatoid arthritis using random forests and Bayesian networks

^{}

^{1,}

^{4}Qiong Yang,

^{2,}

^{3}Karen T Cuenco,

^{1}L Adrienne Cupples,

^{2}Anita L DeStefano,

^{2,}

^{3}and Kathryn L Lunetta

^{2}

^{1}Genetics Program, Department of Medicine, School of Medicine, Boston University, 715 Albany Street, Boston, Massachusetts 02118 USA

^{2}Department of Biostatistics, School of Public Health, Boston University, 715 Albany Street, Boston, Massachusetts 02118 USA

^{3}Department of Neurology, School of Medicine, Boston University, 715 Albany Street, Boston, Massachusetts 02118 USA

^{4}Current affiliation: Center for Human Genetic Research, Massachusetts General Hospital, Boston, Massachusetts 02114 USA; Broad Institute of Harvard and Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 USA.

^{}Corresponding author.

#### Supplement

#### Conference

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.

## Abstract

We used the simulated data set from Genetic Analysis Workshop 15 Problem 3 to assess a two-stage approach for identifying single-nucleotide polymorphisms (SNPs) associated with rheumatoid arthritis (RA). In the first stage, we used random forests (RF) to screen large amounts of genetic data using the variable importance measure, which takes into account SNP interaction effects as well as main effects without requiring model specification. We used the simulated 9187 SNPs mimicking a 10 K SNP chip, along with covariates DR (the simulated DRB1 gentoype), smoking, and sex as input to the RF analyses with a training set consisting of 750 unrelated RA cases and 750 controls. We used an iterative RF screening procedure to identify a smaller set of variables for further analysis. In the second stage, we used the software program CaMML for producing Bayesian networks, and developed complex etiologic models for RA risk using the variables identified by our RF screening procedure. We evaluated the performance of this method using independent test data sets for up to 100 replicates.

## Background

It is commonly believed that complex diseases are caused not by single genes acting alone, but by multiple genes and non-genetic factors interacting with one another. Due to the large number of single-nucleotide polymorphisms (SNPs) now available in genome-wide scans, the computational burden of testing each locus for main effects and all possible two-way, three-way, and higher-order interactions is overwhelming. One approach to reducing the number of interactions to examine is to perform a two-stage analysis. In the first stage, one identifies a subset of SNPs for further analysis of interaction in the second stage. Often, a univariate test (e.g., a chi-square test) is used to identify SNPs associated with outcome in the first stage. When risk-associated SNPs have small marginal effects but large interaction effects in the population, univariate methods will result in low power for detecting these SNPs. "Multi-locus" approaches consider interactions of multiple genes and environmental factors in identifying susceptibility loci for complex diseases [1]. Random Forests (RFs) [2] provide a powerful method for detecting interacting risk susceptibility SNPs (rSNPs) [3]. However, this method does not provide a model that delineates the interactions.

Bayesian networks (or directed graphical models) are graphs in which the nodes represent random variables and the arrows represent dependence relationships [4]. These methods have been successfully applied to generate a model describing the relationship among SNPs in multiple candidate genes for a complex trait [5].

## Methods

We used the 100 replicates of simulated data in Problem 3 provided by the Genetic Analysis Workshop 15 (GAW15). We performed analyses with knowledge of the "real" answers but screened all of the 9187 SNPs, distributed on the genome to mimic a 10 K SNP chip without regard to the generating model. We used disease status for rheumatoid arthritis (RA) as the outcome and smoking, sex and DR genotype (the simulated DRB1 genotype) as covariates.

### Subjects

To obtain biologically independent cases, for each replicate we randomly selected one affected sibling from each of 1500 nuclear families. These 1500 cases were then divided at random into a training data set of 750 affected subjects and a test data set of 750 cases. The GAW data provided 2000 unrelated unaffected individuals for use as controls. Two independent sets of 750 controls were selected at random from the 2000 for use as training data set and test data set controls. Thus, for each replicate we had independent training and test data sets consisting of 750 cases and 750 controls.

### Random Forests

RFs grow a large number of classification or regression trees with no trimming or pruning. The RF method produces an importance score for each variable that quantifies the relative contribution of that variable to the prediction accuracy. We used this score to prioritize the predictor variables. The RF also produces prediction errors for the individuals, which we used for evaluation of the method.

We used Random Forests version 5 [6] to analyze the training data. We used an iterative process similar to a strategy previously proposed for gene expression analysis [7] in which, at each iteration, we built a random forest using the training data, and saved the 50% of variables with the highest importance scores to build the next forest. The random forests built at each iteration were named IT_{0}, IT_{1},..., IT_{n}, and the prediction errors of the training data set were estimated for the forest built at each iteration. We call the forest with the best prediction error IT_{bp}. The variables included in IT_{bp }were then used in second-stage analysis. We compared the performance of the iterative procedure that resulted in the forest IT_{bp}, in terms of keeping the true risk variables and removing noise variables, to a simple procedure of selecting the top 50 ranked variables by importance from iteration 0, in the test data sets. Specifically, we compared the prediction error of the IT_{bp }forest, the IT_{0 }forest (all variables used; no selection), and a forest built using only the top 50 SNPs from the IT_{0 }forest ("IT_{top50}"). Because the iterative procedure averaged 53 SNPs in the final forest, we chose 50 SNPs from IT_{0 }to yield a forest with approximately the same number of SNPs. We computed prediction error using the test data ("test"), and using the out-of-bag observations of the training data set ("training").

### Network inference

Bayesian networks (BN) are directed acyclic graphs for representing the joint probability distribution of all variables. A network for discrete variables, e.g., Figure Figure1,1, is specified by the graph structure (nodes and arcs) and the conditional probability table (CPT) at each node (node chr6_162 is shown). Each node is a variable, and each directed arc implies association and direction of dependency between the two variables. The origin node of an arc is usually called the parental node, and nodes that an arc points to are called child nodes. A child node is conditionally independent of other nodes given its parental nodes. Thus, the joint probability of *n *variables can be simplified to $P({x}_{1},{x}_{2},\mathrm{...},{x}_{n})={\displaystyle \prod _{i=1}^{n}P({x}_{i}|}{x}_{i1},{x}_{i2},\mathrm{...},{x}_{i{k}_{i}})$, where *x*_{il}, *x*_{i2},..., *x*_{ik }in the condition are the parental nodes of *x*_{i }and a subset of *x*_{1}, *x*_{2}, *x*_{i-1},..., *x*_{i+1}, *x*_{n}. BN models are useful for describing complex relationships among variables, as well as for making predictions for variables that are regarded as outcomes.

CaMML [8], Causal Minimum Message Length (MML), is a program for generating Bayesian networks. The general goal is to find a model that maximizes the posterior probability of that model given the data. CaMML searches over all possible structures (models) using the Metropolis algorithm. It uses MML as a metric that includes a penalty on model complexity to control the resampling process. We evaluated the performance of CaMML on a set of variables used in the IT_{bp }forest described above. We used the test data set to predict case status and estimate prediction error.

## Results

We identified the best surrogates for all risk loci (A-G) as the SNPs with the highest linkage disequilibrium (LD) (*r*^{2}) with risk loci from the answer files given with the GAW15 data (Table (Table1).1). For locus C, three SNPs had *r*^{2 }≥ 0.2; for locus D, two SNPs had *r*^{2 }≥ 0.2. When analyzing the results, we considered these SNPs true positives, in that they are the best proxies for the true risk loci that were not genotyped.

### Risk variables identified by RF

We compared IT_{bp }and IT_{0 }top 50 for choosing a set of variables by comparing how often the best surrogates for loci A-G appeared in the variable set. DR and the best surrogates for C, D, and F were included in 94 and 98 out of 100 replicates for the IT_{bp }forest and the top 50 variables for IT_{0 }forest, respectively. The average number of variables included in the IT_{bp }forest was 53 (range 8–287). The IT_{bp }forest occurred, on average, at iteration 7.64 (range 5–10).

### Estimate of prediction error

As seen in Table Table2,2, the mean and median prediction error for the training data sets is smaller than that for the test data sets for the IT_{bp }and IT_{top50 }methods (median differences -2.77, -0.93, *p *< 0.0001), which may indicate overfitting. The IT_{0 }forest gives similar prediction error for test and training data.

For the training data sets, the mean prediction error for the IT_{bp }forests is smaller than that for the IT_{0 }forests; the IT_{top50 }forests fall in between (Table (Table3).3). For the test data sets, although both IT_{top50 }and IT_{bp }outperform IT_{0}, the IT_{bp }has larger prediction error than IT_{top50 }(difference in median = 0.43, *p *< 0.0001), which might be due to overfitting for the iterative method.

### Network inference

We used CaMML to analyze the variables selected from IT_{bp }for Replicates 1 to 50. Due to computational limits, if more than 50 variables were selected by IT_{bp}, only the top 50 variables were used for second-stage analysis. With the maximum number of variables restricted to 50, the average number of variables used in CaMML across the 50 replicates was 40. In the estimated BNs, an average of 11 variables were connected to RA status directly or indirectly through other variables in a path of a network that included RA status. The average prediction error using the test data was 12.4% (Table (Table2),2), which is smaller than that of IT_{bp }(Table (Table4).4). An example BN with the conditional probability table (CPT) for node chr6_162, using Replicate 1 is displayed in Figure Figure1.1. In this BN, all SNPs included in the analysis with *r*^{2 }> 0.3 with one of the disease loci (Table (Table1)1) were connected directly or indirectly to RA. Many SNPs on chromosome 6 were interconnected due to LD between these markers. The CPT for node chr6_162 showed 5.5-fold increased risk of RA for carrying allele 3 versus allele 2.

Table Table11 displays the frequency of variables appearing in the network for Replicates 1–50. We have 100% power to detect SNP6_152, SNP6_153, SNP6_154 (surrogates for locus C), SNP6_162 (surrogate for locus D), and SNP11_389 (surrogate for locus F), all of which have strong LD (*r*^{2 }≥ 0.418) with disease loci. We have lower power (66%) to detect SNP6_160, a surrogate for D that is in lower LD (*r*^{2 }= 0.273). Despite its low LD with locus C (*r*^{2 }= 0.104), the power to detect SNP6_155 is 98%. This may be due to the very strong effect of locus C. Importantly, CaMML identified all covariates (DR, sex, and smoking) and almost all surrogates in LD with disease loci (with exception of SNP6_160, which was not detected by CaMML in one replicate) as part of the RA network from variables selected from IT_{bp}.

## Discussion

Using the simulated data from Problem 3, we assessed a two-stage approach for identifying SNPs associated with RA that employs random forests to identify important variables, and Bayesian networks to further filter out noise SNPs by reducing prediction error. The random forest analysis reduced the number of variables for further Bayesian network analyses from 9190 to about 53. This screening strategy successfully filtered out many SNPs unassociated with the disease loci, while keeping the surrogates for risk SNPs for four out of nine of these loci (DR, C, D, and F) in 94 of 100 replicates. Although IT_{bp }seems to give lower prediction error than IT_{top50 }in training data sets, IT_{top50 }gives lower prediction error than IT_{bp }in test data sets. Therefore, the strategy of building a second forest using the top 50 SNPs from a first forest may be a better variable selection method overall. However, the effects of these loci in this data set are very strong, and it is not clear that this result will generalize to data weaker association signals. Further, it is not clear how to choose the number of variables to select if one uses the simpler procedure. Additional simulation studies are needed to determine how to generalize our results to less ideal circumstances. The fact that the difference in the median of prediction errors for training and test data sets are large for IT_{bp }suggests overfitting; however, because we removed a large (50%) proportion of "noise" in this first stage, IT_{bp }is not expected to be the optimal RF with the lowest prediction error. It is possible to remove one noise variable at a time; however, it is not practical in the context of thousands of variables. We expected the BN analysis to further reduce the number of noise SNPs and provide some guidance as to important interaction effects.

Bayesian network analysis based on a subset of the variables (≤ 50) selected from IT_{bp }captured most of the true loci and the correct dependencies among them and further decreased the test set prediction error. The network model provides a method for predicting case status and facilitates the understanding of complex relationships between the disease and genetic and environmental factors. The limitations of BN include the difficulty to discern the exact relationship between variables that are interconnected and the exponential increase in computation time with the number of variables. These make BN impractical for genome-wide scan of dense SNPs. However, BN results are at least useful to generate potentially biological meaningful hypotheses to be confirmed by further statistical analyses or/and biological experiments.

## Competing interests

The author(s) declare that they have no competing interests.

## Acknowledgements

This work was supported by grants from Fonds de la Recherche en Santé (YM), the National Institutes of Health (R01 AG09029 to YM, R01 AG017173 to KTC, R01 NS36711-04 to AD) and the National Heart, Lung and Blood Institute's Framingham Heart Study Contract N01-HC-25195 (QY). It utilized the Boston University Linux Cluster for Genetic Analysis (LinGA), which is funded by the NIH National Center for Research Resources Shared Instrumentation grant (S10 RR163736-01A1). The authors thank Lucas Hope and Rodney O'Donnell from the Faculty of Information Technology at Monash University, Australia for their assistance with the CaMML program.

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.

## References

- Hoh J, Ott J. Mathematical multi-locus approaches to localizing complex human trait genes. Nat Rev Genet. 2003;4:701–709. doi: 10.1038/nrg1155. [PubMed] [Cross Ref]
- Breiman L. Random forests. Mach Learn. 2001;45:5–32. doi: 10.1023/A:1010933404324. [Cross Ref]
- Lunetta KL, Hayward LB, Segal J, Van Eerdewegh P. Screening large-scale association study data: exploiting interactions using random forests. BMC Genet. 2004;5:32. doi: 10.1186/1471-2156-5-32. [PMC free article] [PubMed] [Cross Ref]
- Murphy K. A brief introduction to graphical models and Bayesian networks http://www.cs.ubc.ca/~murphyk/Bayes/bnintro.html
- Sebastiani P, Ramoni MF, Nolan V, Baldwin CT, Steinberg MH. Genetic dissection and prognostic modeling of overt stroke in sickle cell anemia. Nat Genet. 2005;37:435–440. doi: 10.1038/ng1533. [PMC free article] [PubMed] [Cross Ref]
- Breiman L, Cutler A. Random forests. Version 5 http://www.stat.berkeley.edu/users/breiman/RandomForests/
- Diaz-Uriarte R, Alvarez de Andres S. Gene selection and classification of microarray data using random forest. BMC Bioinformatics. 2006;7:3. doi: 10.1186/1471-2105-7-3. [PMC free article] [PubMed] [Cross Ref]
- Wallace CS, Korb KB. Learning linear causal models by MML sampling. In: Gammerman A, editor. Causal Models and Intelligent Data Management. Berlin: Springer-Verlag; 1999. pp. 89–111.

**BioMed Central**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (266K) |
- Citation

- Picking single-nucleotide polymorphisms in forests.[BMC Proc. 2007]
*Schwarz DF, Szymczak S, Ziegler A, König IR.**BMC Proc. 2007; 1 Suppl 1:S59. Epub 2007 Dec 18.* - Screening large-scale association study data: exploiting interactions using random forests.[BMC Genet. 2004]
*Lunetta KL, Hayward LB, Segal J, Van Eerdewegh P.**BMC Genet. 2004 Dec 10; 5:32. Epub 2004 Dec 10.* - Comparison of variable and model selection methods for genetic association studies using the GAW15 simulated data.[BMC Proc. 2007]
*Ye Z, Atkinson EJ, Fridley BL, de Andrade M.**BMC Proc. 2007; 1 Suppl 1:S34. Epub 2007 Dec 18.* - Gene x gene and gene x environment interactions for complex disorders.[BMC Proc. 2007]
*Culverhouse R, Hinrichs AL, Jin CH, Suarez BK.**BMC Proc. 2007; 1 Suppl 1:S72. Epub 2007 Dec 18.* - Contribution of Fcgamma receptor IIIA gene 158V/F polymorphism and copy number variation to the risk of ACPA-positive rheumatoid arthritis.[Ann Rheum Dis. 2009]
*Thabet MM, Huizinga TW, Marques RB, Stoeken-Rijsbergen G, Bakker AM, Kurreeman FA, White SJ, Toes RE, van der Helm-van Mil AH.**Ann Rheum Dis. 2009 Nov; 68(11):1775-80. Epub 2008 Nov 19.*

- Mining Pure, Strict Epistatic Interactions from High-Dimensional Datasets: Ameliorating the Curse of Dimensionality[PLoS ONE. ]
*Jiang X, Neapolitan RE.**PLoS ONE. 7(10)e46771* - TRM: A Powerful Two-stage Machine Learning Approach for Identifying SNP-SNP Interactions[Annals of human genetics. 2012]
*Lin HY, Chen YA, Tsai YY, Qu X, Tseng TS, Park JY.**Annals of human genetics. 2012 Jan; 76(1)53-62* - Random Forests for Genetic Association Studies[Statistical Applications in Genetics and Mo...]
*Goldstein BA, Polley EC, Briggs FB.**Statistical Applications in Genetics and Molecular Biology. 10(1)Article 32* - Learning genetic epistasis using Bayesian network scoring criteria[BMC Bioinformatics. ]
*Jiang X, Neapolitan RE, Barmada MM, Visweswaran S.**BMC Bioinformatics. 1289* - Performance of random forest when SNPs are in linkage disequilibrium[BMC Bioinformatics. ]
*Meng YA, Yu Y, Cupples LA, Farrer LA, Lunetta KL.**BMC Bioinformatics. 1078*

- dbGaP LinksdbGaP LinksdbGaP Links
- MedGenMedGenRelated information in MedGen
- PubMedPubMedPubMed citations for these articles

- Two-stage approach for identifying single-nucleotide polymorphisms associated wi...Two-stage approach for identifying single-nucleotide polymorphisms associated with rheumatoid arthritis using random forests and Bayesian networksBMC Proceedings. 2007; 1(Suppl 1)S56

Your browsing activity is empty.

Activity recording is turned off.

See more...