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
An overview and comparison of machine-learning techniques for classification purposes in digital soil mapping
TL;DR: This study provides a comprehensive comparison of machine-learning techniques for classification purposes in soil science and may assist in model selection for digital soil mapping and geomorphic modeling studies in the future.
Proceedings ArticleDOI
Ensemble deep learning for regression and time series forecasting
TL;DR: An ensemble of deep learning belief networks (DBN) is proposed for regression and time series forecasting and the advantage of the proposed method on three electricity load demand datasets, one artificial time series dataset and three regression datasets over other benchmark methods is shown.
Journal ArticleDOI
Forest ecosystems, disturbance, and climatic change in Washington State, USA
Jeremy S. Littell,Elaine Oneil,Donald C. McKenzie,Jeffrey A. Hicke,James A. Lutz,Robert A. Norheim,Marketa M. Elsner +6 more
TL;DR: In this article, the role of climate in four forest ecosystem processes and project the effects of future climatic change on these processes across Washington State is addressed and the relationship between climate and the area burned by fire and project climatically driven regional and sub-regional increases in area burned.
Journal ArticleDOI
Predicting antimicrobial peptides with improved accuracy by incorporating the compositional, physico-chemical and structural features into Chou's general PseAAC.
TL;DR: This study made an attempt to develop a support vector machine (SVM) based computational approach for prediction of AMPs with improved accuracy, and achieved higher accuracy than several existing approaches, while compared using benchmark dataset.
Journal ArticleDOI
Recursive SVM feature selection and sample classification for mass-spectrometry and microarray data
Xuegong Zhang,Xin Lu,Qian Shi,Xiu-qin Xu,Hon-chiu Eastwood Leung,Lyndsay Harris,James Dirk Iglehart,Alexander Miron,Jun Liu,Wing Hung Wong +9 more
TL;DR: The proposed R-SVM method is suitable for analyzing noisy high-throughput proteomics and microarray data and it outperforms SVM-RFE in the robustness to noise and in the ability to recover informative features.
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.