Evaluation of single-nucleotide polymorphism imputation using random forests

Risk estimation and risk prediction using machine-learning methods

After an association between genetic variants and a phenotype has been established, further study goals comprise the classification of patients according to disease risk or the estimation of disease probability. To accomplish this, different statistical methods are required, and specifically machine-learning approaches may offer advantages over classical techniques. In this paper, we describe methods for the construction and evaluation of classification and probability estimation rules. We review the use of machine-learning approaches in this context and explain some of the machine-learning algorithms in detail. Finally, we illustrate the methodology through application to a genome-wide association analysis on rheumatoid arthritis.

Genomic approach towards personalized anticancer drug therapy

Stratification of patients for multidrug response is a promising strategy for cancer treatment. Genome-based prediction models have great potential for this purpose because the extent of drug sensitivity may be attributed to the heterogeneity of the underlying genetic characteristics of cancer. However, microarray data is difficult to analyze and is not reproducible. Several machine-learning algorithms have therefore been developed in a repeatable manner. Random forests algorithm, which uses an ensemble approach based on classification and regression trees, appears to be superior for predicting multidrug sensitivity. This is because ensemble methods are more effective when there are much more predictors than samples. Here, we review recent advances in the development of classification algorithms using microarray technology for prediction of anticancer sensitivity, discuss the availability of ensemble methods for prediction models, and present data regarding the identification of potential responders to FOLFOX therapy using random forests algorithm.

Random forests for genomic data analysis

Random forests (RF) is a popular tree-based ensemble machine learning tool that is highly data adaptive, applies to "large p, small n" problems, and is able to account for correlation as well as interactions among features. This makes RF particularly appealing for high-dimensional genomic data analysis. In this article, we systematically review the applications and recent progresses of RF for genomic data, including prediction and classification, variable selection, pathway analysis, genetic association and epistasis detection, and unsupervised learning.

Random forests for genetic association studies

The Random Forests (RF) algorithm has become a commonly used machine learning algorithm for genetic association studies. It is well suited for genetic applications since it is both computationally efficient and models genetic causal mechanisms well. With its growing ubiquity, there has been inconsistent and less than optimal use of RF in the literature. The purpose of this review is to breakdown the theoretical and statistical basis of RF so that practitioners are able to apply it in their work. An emphasis is placed on showing how the various components contribute to bias and variance, as well as discussing variable importance measures. Applications specific to genetic studies are highlighted. To provide context, RF is compared to other commonly used machine learning algorithms.

On safari to Random Jungle: a fast implementation of Random Forests for high-dimensional data

MOTIVATION

Genome-wide association (GWA) studies have proven to be a successful approach for helping unravel the genetic basis of complex genetic diseases. However, the identified associations are not well suited for disease prediction, and only a modest portion of the heritability can be explained for most diseases, such as Type 2 diabetes or Crohn's disease. This may partly be due to the low power of standard statistical approaches to detect gene-gene and gene-environment interactions when small marginal effects are present. A promising alternative is Random Forests, which have already been successfully applied in candidate gene analyses. Important single nucleotide polymorphisms are detected by permutation importance measures. To this day, the application to GWA data was highly cumbersome with existing implementations because of the high computational burden.

RESULTS

Here, we present the new freely available software package Random Jungle (RJ), which facilitates the rapid analysis of GWA data. The program yields valid results and computes up to 159 times faster than the fastest alternative implementation, while still maintaining all options of other programs. Specifically, it offers the different permutation importance measures available. It includes new options such as the backward elimination method. We illustrate the application of RJ to a GWA of Crohn's disease. The most important single nucleotide polymorphisms (SNPs) validate recent findings in the literature and reveal potential interactions.

AVAILABILITY

The RJ software package is freely available at http://www.randomjungle.org