Open Access
Classification and Regression by randomForest
Andy Liaw,Matthew C. Wiener +1 more
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
Citations
More filters
Proceedings ArticleDOI
Disambiguating authors in academic publications using random forests
TL;DR: This paper describes an algorithm for pair-wise disambiguation of author names based on a machine learning classification algorithm, random forests, and defines a set of similarity profile features to assist in author disambigsuation.
Proceedings ArticleDOI
Detecting Clusters of Fake Accounts in Online Social Networks
TL;DR: A scalable approach to finding groups of fake accounts registered by the same actor by using a supervised machine learning pipeline for classifying {\em an entire cluster} of accounts as malicious or legitimate.
Journal ArticleDOI
Modelling uniaxial compressive strength of lightweight self-compacting concrete using random forest regression
Junfei Zhang,Guowei Ma,Guowei Ma,Yimiao Huang,Junbo Sun,Farhad Aslani,Farhad Aslani,Brett Nener +7 more
TL;DR: In this article, a beetle antennae search (BAS) algorithm based random forest (RF) model was proposed to accurately and effectively predict the uniaxial compressive strength (UCS) of self-compacting concrete (LWSCC).
Journal ArticleDOI
Childhood Maltreatment, Depression, and Suicidal Ideation: Critical Importance of Parental and Peer Emotional Abuse during Developmental Sensitive Periods in Males and Females
Alaptagin Khan,Hannah McCormack,Elizabeth A. Bolger,Cynthia E. McGreenery,Gordana Dragan Vitaliano,Gordana Dragan Vitaliano,Ann Polcari,Martin H. Teicher,Martin H. Teicher +8 more
TL;DR: Evidence is provided for sensitive exposure periods when maltreatment maximally impacts risk for depression, and these findings fit with emerging neuroimaging evidence for regional sensitivity periods.
Journal ArticleDOI
Rattle: A Data Mining GUI for R
TL;DR: The Rattle package provides a graphical user in- terface specifically for data mining using R and provides a stepping stone toward using R as a programming language for data analysis.
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.