Statistics Surveys · 2009 · 204 citations · 56 references
ComputingComputer ScienceData ScienceData AnalyticsData MiningMachine LearningClassificationDecision TreesEnsemble LearningEnsemble MethodsBaggingBoosted TreesCart AlgorithmConsistencyEnsemble ClassificationImportance MeasuresMethodological ProgressRandom Forests
This article addresses current methodological research on non-parametric Random Forests. It provides a brief intellectual history of Random Forests that covers CART, boosting and bagging methods. It then introduces the primary methods by which researchers can visualize results, the relationships between covariates and responses, and the out-of-bag test set error. In addition, the article considers current research on universal consistency and importance tests in Random Forests. Finally, several uses for Random Forests are discussed, and available software is identified.
56
Leo Breiman · Machine Learning · 2001 · 126.2K citations · Full text
Greedy function approximation: A gradient boosting machine.
Jerome H. Friedman · The Annals of Statistics · 2001 · 29K citations · Full text
Classification and Regression Trees.
Alexander Gordon, Leo Breiman, Jerome H. Friedman et al. · Biometrics · 1984 · 23.9K citations
Classification and Regression by randomForest
Andy Liaw, Matthew C. Wiener · 2007 · 18.4K citations