# Classification and Regression Trees

@inproceedings{Breiman1983ClassificationAR, title={Classification and Regression Trees}, author={L. Breiman and J. Friedman and R. Olshen and C. J. Stone}, year={1983} }

Background. Introduction to Tree Classification. Right Sized Trees and Honest Estimates. Splitting Rules. Strengthening and Interpreting. Medical Diagnosis and Prognosis. Mass Spectra Classification. Regression Trees. Bayes Rules and Partitions. Optimal Pruning. Construction of Trees from a Learning Sample. Consistency. Bibliography. Notation Index. Subject Index.

#### Figures and Topics from this paper

#### 17,565 Citations

Classification and Regression Tree Methods

- Computer Science
- 2008

This article discusses the C4.5, CART, CRUISE, GUIDE, and QUEST methods in terms of their algorithms, features, properties, and performances. Expand

Classification and Regression Trees

- Computer Science
- 2014

CART is a method that provides mechanisms for building a custom-specific, nonparametric estimation model based solely on the analysis of measurement project data, called training data. Expand

Classification and Regression Trees

- Mathematics
- 2000

We will call an estimator for the regression function defined by the CART methodology a regression tree. The word CART means classification and regression tree. This chapter will focus only on the… Expand

Cost-Sensitive Pruning of Decision Trees

- Computer Science
- ECML
- 1994

This paper shows how the misclassification costs, a related criterion applied if errors vary in their costs, can be integrated in several well-known pruning techniques. Expand

Survival Trees by Goodness of Split

- Mathematics
- 1993

Abstract A tree-based method for censored survival data is developed, based on maximizing the difference in survival between groups of patients represented by nodes in a binary tree. The method… Expand

Selecting the best categorical split for classification trees

- Mathematics
- 2001

Based on a family of splitting criteria for classification trees, methods of selecting the best categorical splits are studied. They are shown to be very useful in reducing the computational… Expand

Data Mining Classification : Basic Concepts , Decision Trees , and Model Evaluation

- 2004

Classification, which is the task of assigning objects to one of several predefined categories, is a pervasive problem that encompasses many diverse applications. Examples include detecting spam… Expand

The use of classification and regression trees in clinical epidemiology.

- Mathematics, Medicine
- Journal of clinical epidemiology
- 2001

A critique is presented of the use of tree-based partitioning algorithms to formulate classification rules and identify subgroups from clinical and epidemiological data, and the issue of redundancy in tree-derived decision rules is discussed. Expand

Randomization in Aggregated Classification Trees

- Computer Science
- 2005

This paper discusses and compares different methods for model aggregation, and addresses the problem of finding minimal number of trees sufficient for the forest. Expand

Using Model Trees for Classification

- Mathematics, Computer Science
- Machine Learning
- 2004

Surprisingly, using this simple transformation the model tree inducer M5′, based on Quinlan's M5, generates more accurate classifiers than the state-of-the-art decision tree learner C5.0, particularly when most of the attributes are numeric. Expand

#### References

SHOWING 1-10 OF 26 REFERENCES

Induction over large data bases

- Computer Science
- 1979

Techniques for discovering rules by induction from large collections of instances are developed. These are based on an iterative scheme for dividing the instances into two sets, only one of which… Expand

Efficient decision tree design for discrete variable pattern recognition problems

- Mathematics, Computer Science
- Pattern Recognit.
- 1977

An algorithm is developed for the design of an efficient decision tree with application to the pattern recognition problems involving discrete variables by defining a criterion to estimate the minimum expected cost of a tree in terms of the weights of its terminal nodes and costs of the measurements. Expand

Application of information theory to the construction of efficient decision trees

- Mathematics, Computer Science
- IEEE Trans. Inf. Theory
- 1982

This heuristic approach to the problem of conversion of decision tables to decision trees is treated and has low design complexity and yet provides near-optimal decision trees. Expand

A Partitioning Algorithm with Application in Pattern Classification and the Optimization of Decision Trees

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1973

A two-stage algorithm that obtains a sufficient partition suboptimally, either by methods suggested in the paper or developed elsewhere, and optimizes the results of the first stage through a dynamic programming approach is proposed. Expand

Hierarchical Classifier Design Using Mutual Information

- Computer Science, Medicine
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- 1982

A nonparametric algorithm is presented for the hierarchical partitioning of the feature space that generates an efficient partitioning tree for specified probability of error by maximizing the amount of average mutual information gain at each partitioning step. Expand

Identification Keys and Diagnostic Tables: a Review

- Engineering
- 1980

Professor E. M. L. BEALE in the Chair] SUMMARY The methodology and fields of application of identification keys and diagnostic tables are reviewed, consideration being given to both mathematical… Expand

Pattern classification and scene analysis

- Computer Science, Mathematics
- A Wiley-Interscience publication
- 1973

The topics treated include Bayesian decision theory, supervised and unsupervised learning, nonparametric techniques, discriminant analysis, clustering, preprosessing of pictorial data, spatial filtering, shape description techniques, perspective transformations, projective invariants, linguistic procedures, and artificial intelligence techniques for scene analysis. Expand

An Algorithm for Constructing Optimal Binary Decision Trees

- Mathematics, Computer Science
- IEEE Transactions on Computers
- 1977

It is shown that an optimal tree can be recursively constructed through the application of invariant imbedding (dynamic programming) and an algorithm is detailed which embodies this recursive approach. Expand

Regression and ANOVA with Zero-One Data: Measures of Residual Variation

- Mathematics
- 1978

Abstract We consider regression situations for which the response variable is dichotomous. The most common analysis fits successively richer linear logistic models and measures the residual variation… Expand

Some methods for classification and analysis of multivariate observations

- Mathematics
- 1967

The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to give… Expand