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
Spatiotemporal Developmental Trajectories in the Arabidopsis Root Revealed Using High-Throughput Single-Cell RNA Sequencing.
TL;DR: A high-resolution scRNA-seq expression atlas of the Arabidopsis root composed of thousands of independently profiled cells is presented, revealing key developmental regulators and downstream genes that translate cell fate into distinctive cell shapes and functions.
Journal ArticleDOI
Sensing spatial distribution of urban land use by integrating points-of-interest and Google Word2Vec model
TL;DR: An innovative framework that detects urban land use distributions at the scale of traffic analysis zones (TAZs) by integrating Baidu POIs and a Word2Vec model is established and can be used to help urban planners to monitor dynamic urban landUse and evaluate the impact of urban planning schemes.
Posted Content
Inferring land use from mobile phone activity
TL;DR: In this paper, a machine learning classification algorithm is used to identify clusters of locations with similar zoned uses and mobile phone activity patterns, and identify the relationship between land use and dynamic population over the course of a typical week.
Journal ArticleDOI
A 30-m landsat-derived cropland extent product of Australia and China using random forest machine learning algorithm on Google Earth Engine cloud computing platform
P Teluguntla,P Teluguntla,Prasad S. Thenkabail,Adam J. Oliphant,Jun Xiong,Murali Krishna Gumma,Russell G. Congalton,Kamini Yadav,Alfredo Huete +8 more
TL;DR: In this paper, a pixel-based supervised random forest (RF) machine learning algorithm (MLA) was used on the Google Earth Engine (GEE) cloud computing platform.
Journal ArticleDOI
A Structure-Based Drug Discovery Paradigm.
TL;DR: This review focuses on the currently available methods and algorithms for structure-based drug design including virtual screening and de novo drug design, with a special emphasis on AI- and deep-learning-based methods used for drug discovery.
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.