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
Journal ArticleDOI
ICCDetector: ICC-Based Malware Detection on Android
Ke Xu,Yingjiu Li,Robert H. Deng +2 more
TL;DR: A new malware detection method, named ICCDetector, that detects and classifies malwares into five newly defined malware categories, which help understand the relationship between malicious behaviors and ICC characteristics, and provides a systemic analysis of ICC patterns of benign apps and malWares.
Journal ArticleDOI
An insight into machine-learning algorithms to model human-caused wildfire occurrence
Marcos Rodrigues,Juan de la Riva +1 more
TL;DR: This paper proposes the use of ML within the context of fire risk prediction, and more specifically, in the evaluation of human-induced wildfires in Spain, and suggests that any of these ML algorithms leads to an improvement in the accuracy of the model when compared to traditional methods.
Journal ArticleDOI
A Comprehensive Survey of Loss Functions in Machine Learning
TL;DR: This paper summarizes and analyzes 31 classical loss functions in machine learning from the aspects of traditional machine learning and deep learning respectively and mainly selects object detection and face recognition to introduces their loss functions.
Journal ArticleDOI
WHISTLE: a high-accuracy map of the human N6-methyladenosine (m6A) epitranscriptome predicted using a machine learning approach.
Kunqi Chen,Kunqi Chen,Zhen Wei,Zhen Wei,Qing Zhang,Xiangyu Wu,Xiangyu Wu,Rong Rong,Rong Rong,Zhi-Liang Lu,Zhi-Liang Lu,Jionglong Su,João Pedro de Magalhães,Daniel J. Rigden,Jia Meng,Jia Meng +15 more
TL;DR: A network-based approach was implemented according to the ‘guilt-by-association’ principle by integrating RNA methylation profiles, gene expression profiles and protein–protein interaction data, and the WHISTLE web server was built to facilitate the query of the high-accuracy map of the human m6A epitranscriptome.
Journal ArticleDOI
Mapping rice paddy extent and intensification in the Vietnamese Mekong River Delta with dense time stacks of Landsat data
TL;DR: In this article, the authors used dense Landsat time stacks for circa 2000 and circa 2010 to map rice paddy extent using vegetation trajectories, then combined these pixel-based rice maps with image-based segments to generate a polygonbased rice map.
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.