Random Forests
Leo Breiman
- Vol. 45, Iss: 1, pp 5-32
TLDR
Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the forest, and are also applicable to regression.Abstract:
Random forests are a combination of tree predictors such that each tree depends on the values of a random vector sampled independently and with the same distribution for all trees in the forest. The generalization error for forests converges a.s. to a limit as the number of trees in the forest becomes large. The generalization error of a forest of tree classifiers depends on the strength of the individual trees in the forest and the correlation between them. Using a random selection of features to split each node yields error rates that compare favorably to Adaboost (Y. Freund & R. Schapire, Machine Learning: Proceedings of the Thirteenth International conference, aaa, 148–156), but are more robust with respect to noise. Internal estimates monitor error, strength, and correlation and these are used to show the response to increasing the number of features used in the splitting. Internal estimates are also used to measure variable importance. These ideas are also applicable to regression.read more
Citations
More filters
Journal ArticleDOI
Concepts of Artificial Intelligence for Computer-Assisted Drug Discovery
TL;DR: The current state-of-the art of AI-assisted pharmaceutical discovery is discussed, including applications in structure- and ligand-based virtual screening, de novo drug design, physicochemical and pharmacokinetic property prediction, drug repurposing, and related aspects.
Journal ArticleDOI
Breast Cancer Multi-classification from Histopathological Images with Structured Deep Learning Model.
TL;DR: The structured deep learning model used in this study has achieved remarkable performance on a large-scale dataset, which demonstrates the strength of the method in providing an efficient tool for breast cancer multi-classification in clinical settings.
Journal ArticleDOI
Up-regulation of cytokines and chemokines predates the onset of rheumatoid arthritis
Heidi Kokkonen,Ingegerd Söderström,Joacim Rocklöv,Göran Hallmans,Kristina Lejon,Solbritt Rantapää Dahlqvist +5 more
TL;DR: Individuals in whom RA later developed had significantly increased levels of several cytokines, cytokine-related factors, and chemokines representing the adaptive immune system; after disease onset, the involvement and activation of the immune system was more general and widespread.
Journal ArticleDOI
Cancer of the esophagus and esophagogastric junction: data-driven staging for the seventh edition of the American Joint Committee on Cancer/International Union Against Cancer Cancer Staging Manuals.
TL;DR: AJCC/UICC stage groupings for esophageal cancer have not been data-driven or harmonized with stomach cancer as discussed by the authors, but they have been used to develop a data driven, harmonized esophagesageal staging for the seventh edition of the AJCC and UICC cancer staging manuals.
Journal ArticleDOI
Deep MRI brain extraction: A 3D convolutional neural network for skull stripping
Jens Kleesiek,Gregor Urban,Alexander Hubert,Daniel Schwarz,Klaus H. Maier-Hein,Martin Bendszus,Armin Biller +6 more
TL;DR: A 3D convolutional deep learning architecture to address shortcomings of existing methods, not limited to non-enhanced T1w images, and may prove useful for large-scale studies and clinical trials.
References
More filters
Journal ArticleDOI
Bagging predictors
TL;DR: Tests on real and simulated data sets using classification and regression trees and subset selection in linear regression show that bagging can give substantial gains in accuracy.
Proceedings Article
Experiments with a new boosting algorithm
Yoav Freund,Robert E. Schapire +1 more
TL;DR: This paper describes experiments carried out to assess how well AdaBoost with and without pseudo-loss, performs on real learning problems and compared boosting to Breiman's "bagging" method when used to aggregate various classifiers.
Journal ArticleDOI
The random subspace method for constructing decision forests
TL;DR: A method to construct a decision tree based classifier is proposed that maintains highest accuracy on training data and improves on generalization accuracy as it grows in complexity.
Journal ArticleDOI
An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization
TL;DR: In this article, the authors compared the effectiveness of randomization, bagging, and boosting for improving the performance of the decision-tree algorithm C4.5 and found that in situations with little or no classification noise, randomization is competitive with bagging but not as accurate as boosting.
Journal ArticleDOI
An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants
Eric Bauer,Ron Kohavi +1 more
TL;DR: It is found that Bagging improves when probabilistic estimates in conjunction with no-pruning are used, as well as when the data was backfit, and that Arc-x4 behaves differently than AdaBoost if reweighting is used instead of resampling, indicating a fundamental difference.