Random forest

From Wikipedia, the free encyclopedia

Jump to: navigation, search

Random forest is a machine learning ensemble classifier that consists of many decision trees and outputs the class that is the mode of the class's output by individual trees. The algorithm for inducing a random forest was developed by Leo Breiman[1] and Adele Cutler, and "Random Forests" is their trademark. The term came from random decision forests that was first proposed by Tin Kam Ho of Bell Labs in 1995. The method combines Breiman's "bagging" idea and Ho's "random subspace method" to construct a collection of decision trees with controlled variations.


[edit] Learning algorithm

Each tree is constructed using the following algorithm:

  1. Let the number of training cases be N, and the number of variables in the classifier be M.
  2. We are told the number m of input variables to be used to determine the decision at a node of the tree; m should be much less than M.
  3. Choose a training set for this tree by choosing N times with replacement from all N available training cases (i.e. take a bootstrap sample). Use the rest of the cases to estimate the error of the tree, by predicting their classes.
  4. For each node of the tree, randomly choose m variables on which to base the decision at that node. Calculate the best split based on these m variables in the training set.
  5. Each tree is fully grown and not pruned (as may be done in constructing a normal tree classifier).

[edit] Advantages

The advantages of random forest are:

  • For many data sets, it produces a highly accurate classifier
  • It handles a very large number of input variables
  • It estimates the importance of variables in determining classification
  • It generates an internal unbiased estimate of the generalization error as the forest building progresses
  • It includes a good method for estimating missing data and maintains accuracy when a large proportion of the data are missing
  • It provides an experimental way to detect variable interactions
  • It can balance error in class population unbalanced data sets
  • It computes proximities between cases, useful for clustering, detecting outliers, and (by scaling) visualizing the data
  • Using the above, it can be extended to unlabeled data, leading to unsupervised clustering, outlier detection and data views
  • Learning is fast

[edit] Disadvantages

  • Random forest are prone to overfitting for some datasets. This is even more pronounced in noisy classification/regression tasks.[2]
  • Random Forest does not handle large numbers of irrelevant features as well as ensembles of entropy-reducing decision trees.[3]
  • It is more efficient to select a random decision boundary than an entropy-reducing decision boundary, thus making larger ensembles more feasible. Although this may seem to be an advantage at first, it has the effect of shifting the computation from training time to evaluation time, which is actually a disadvantage for most applications.

[edit] See also

[edit] References

  1. ^ Breiman, Leo (2001). "Random Forests". Machine Learning 45 (1): 5–32. doi:10.1023/A:1010933404324. 
  2. ^ Segal, Mark R. (April 14 2004), Machine Learning Benchmarks and Random Forest Regression, Center for Bioinformatics & Molecular Biostatistics, http://repositories.cdlib.org/cbmb/bench_rf_regn/ 
  3. ^ Gashler, M.; Giraud-Carrier, C.; Martinez, T. (2008). "Decision Tree Ensemble: Small Heterogeneous Is Better Than Large Homogeneous" in Seventh International Conference on Machine Learning and Applications (ICMLA 08).: 900–905. doi:10.1109/ICMLA.2008.154. 

[edit] Open source implementations

  • The Original RF by Breiman and Cutler. Written in Fortran 77. Difficult to configure.
  • PARF Written in Fortran 90. Can distribute work over a cluster of computers using MPI.
  • FastRandomForest Efficient implementation in Java, utilitizes multiple cores in a machine. Integrates into the Weka environment.
  • randomForest for R

[edit] External links

Personal tools