Abstract
An algorithm known as recursive partitioning is the key to the nonpara- metric statistical method of classification and regression trees (CART) (Breiman, Friedman, Olshen, and Stone, 1984). Recursive partitioning is the step-by-step process by which a decision tree is constructed by either splitting or not splitting each node on the tree into two daughter nodes. An attractive feature of the CART methodology (or the related C4.5 methodology; Quinlan, 1993) is that because the algorithm asks a sequence of hierarchical Boolean questions (e.g., is X j ≤ θ j ?, where θ j is a threshold value), it is relatively simple to understand and interpret the results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer Science+Business Media New York
About this chapter
Cite this chapter
Izenman, A.J. (2013). Recursive Partitioning and Tree-Based Methods. In: Modern Multivariate Statistical Techniques. Springer Texts in Statistics. Springer, New York, NY. https://doi.org/10.1007/978-0-387-78189-1_9
Download citation
DOI: https://doi.org/10.1007/978-0-387-78189-1_9
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-78188-4
Online ISBN: 978-0-387-78189-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)