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
Proceedings ArticleDOI
Investigating Haze-Relevant Features in a Learning Framework for Image Dehazing
TL;DR: It is shown that the dark-channel feature is the most informative one for this task, which confirms the observation of He et al.
Journal ArticleDOI
Guidelines for Developing and Reporting Machine Learning Predictive Models in Biomedical Research: A Multidisciplinary View.
Wei Luo,Dinh Phung,Truyen Tran,Sunil Gupta,Santu Rana,Chandan Karmakar,Alistair Shilton,John Yearwood,Nevenka Dimitrova,Tu Bao Ho,Svetha Venkatesh,Michael Berk +11 more
TL;DR: A set of guidelines was generated to enable correct application of machine learning models and consistent reporting of model specifications and results in biomedical research and it is believed that such guidelines will accelerate the adoption of big data analysis, particularly with machine learning methods, in the biomedical research community.
Proceedings ArticleDOI
Exploiting place features in link prediction on location-based social networks
TL;DR: A supervised learning framework is described which exploits new prediction features based on the properties of the places visited by users which are able to discriminate potential future links among them and which exploits these prediction features to predict new links among friends-of-friends and place-friends.
Journal ArticleDOI
Interpretable classifiers using rules and bayesian analysis: building a better stroke prediction model
TL;DR: In this paper, a generative model called Bayesian rule lists (BRL) is proposed to predict the risk of stroke in patients with atrial fibrillation, which can be used to produce highly accurate and interpretable medical scoring systems.
Journal ArticleDOI
KDEEP: Protein–Ligand Absolute Binding Affinity Prediction via 3D-Convolutional Neural Networks
TL;DR: This work proposes here a fast machine-learning approach for predicting binding affinities using state-of-the-art 3D-convolutional neural networks and compares this approach to other machine- learning and scoring methods using several diverse data sets.
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.