scispace - formally typeset
Open Access

Classification and Regression by randomForest

Reads0
Chats0
TLDR
random forests are proposed, which add an additional layer of randomness to bagging and are robust against overfitting, and the randomForest package provides an R interface to the Fortran programs by Breiman and Cutler.
Abstract
Recently there has been a lot of interest in “ensemble learning” — methods that generate many classifiers and aggregate their results. Two well-known methods are boosting (see, e.g., Shapire et al., 1998) and bagging Breiman (1996) of classification trees. In boosting, successive trees give extra weight to points incorrectly predicted by earlier predictors. In the end, a weighted vote is taken for prediction. In bagging, successive trees do not depend on earlier trees — each is independently constructed using a bootstrap sample of the data set. In the end, a simple majority vote is taken for prediction. Breiman (2001) proposed random forests, which add an additional layer of randomness to bagging. In addition to constructing each tree using a different bootstrap sample of the data, random forests change how the classification or regression trees are constructed. In standard trees, each node is split using the best split among all variables. In a random forest, each node is split using the best among a subset of predictors randomly chosen at that node. This somewhat counterintuitive strategy turns out to perform very well compared to many other classifiers, including discriminant analysis, support vector machines and neural networks, and is robust against overfitting (Breiman, 2001). In addition, it is very user-friendly in the sense that it has only two parameters (the number of variables in the random subset at each node and the number of trees in the forest), and is usually not very sensitive to their values. The randomForest package provides an R interface to the Fortran programs by Breiman and Cutler (available at http://www.stat.berkeley.edu/ users/breiman/). This article provides a brief introduction to the usage and features of the R functions.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Learning Video Saliency from Human Gaze Using Candidate Selection

TL;DR: A novel method for video saliency estimation, inspired by the way people watch videos, is proposed, which explicitly model the continuity of the video by predicting the saliency map of a given frame, conditioned on the map from the previous frame.
Journal ArticleDOI

A data-driven predictive model of city-scale energy use in buildings

TL;DR: In this article, the authors developed a predictive model of energy use at the building, district, and city scales using training data from energy disclosure policies and predictors from widely available property and zoning information.
Journal ArticleDOI

Reduced fractional anisotropy in the visual limbic pathway of young adults witnessing domestic violence in childhood

TL;DR: Findings are consistent with the hypothesis that exposure to childhood maltreatment is associated with alterations in fiber pathways that convey the adverse experience to frontal, temporal or limbic regions.
Journal ArticleDOI

Crop classification of upland fields using Random forest of time-series Landsat 7 ETM+ data

TL;DR: A time-series of medium spatial resolution enhanced vegetation index (EVI) and its summary statistics obtained from Landsat 7 Enhanced Thematic Mapper Plus (Landsat 7 ETM+) were used to develop a new technique for crop type classification and showed that the training dataset size strongly affects the classifier accuracy, but if the training data increase, the rate of improvement decreases.
References
More filters

Modern Applied Statistics With S

TL;DR: The modern applied statistics with s is universally compatible with any devices to read, and is available in the digital library an online access to it is set as public so you can download it instantly.
Proceedings Article

Boosting the margin: A new explanation for the effectiveness of voting methods

TL;DR: In this paper, the authors show that the test error of the generated classifier usually does not increase as its size becomes very large, and often is observed to decrease even after the training error reaches zero.
Journal ArticleDOI

Estimating Generalization Error on Two-Class Datasets Using Out-of-Bag Estimates

TL;DR: For two-class datasets, a method for estimating the generalization error of a bag using out-of-bag estimates is provided and most of the bias is eliminated and accuracy is increased by incorporating a correction based on the distribution of the out- of-bag votes.