Classification and regression trees
Wei‐Yin Loh · Wiley Interdisciplinary Reviews Data Mining and Knowledge Discovery · 2011
Abstract Classification and regression trees are machine‐learning methods for constructing prediction models from data. The models are obtained by recursively partitioning the data space and fitting a simple prediction model within each partition. As a result, the partitioning can be represented graphically as a decision tree. Classification trees are designed for dependent variables that take a finite number of unordered values, with prediction error measured in terms of misclassification cost. Regression trees are for dependent variables that take continuous or ordered discrete values, with prediction error typically measured by the squared difference between the observed and predicted values. This article gives an introduction to the subject by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 14‐23 DOI: 10.1002/widm.8 This article is categorized under: Technologies > Classification Technologies > Machine Learning Technologies > Prediction Algorithmic Development > Statistics
Cited by 2,285 works. doi:10.1002/widm.8
Authors
References
- Random Forests
- Classification and Regression Trees.
- Classification and Regression Trees.
- C4.5: Programs for Machine Learning
- Bagging Predictors
- THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
- Data Mining: Practical Machine Learning Tools and Techniques
- Nearest neighbor pattern classification
- Bagging predictors
- Data Mining