Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Recursive Partitioning and Tree-Based Methods
verfasst von : Alan Julian Izenman
Erschienen in: Modern Multivariate Statistical Techniques
Verlag: Springer New York
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.