Recursive Partitioning and Tree-Based Methods

  • Alan Julian Izenman
Part of the Springer Texts in Statistics book series (STS)


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.


Root Node Regression Tree Terminal Node Gini Index Recursive Partitioning 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Alan Julian Izenman
    • 1
  1. 1.Department of StatisticsTemple UniversityPhiladelphiaUSA

Personalised recommendations