Recursive Partitioning
Resource
Center
Information and Examples of Recursive partitioning software:
Recursive partitioning (RP) is a technique which can be applied to mine large datasets in order to uncover hidden patterns within the data and to elucidate statistically significant sub-groupings within the data. In general terms, RP is a data-analysis method for relating a 'dependent' variable (Y) to a collection of independent ('predictor') variables (X) in order to uncover -- or simply understand -- the elusive relationship, Y=f(X).
Recursive partitioning is particularly strongly-suited for scenarios where conventional statistical techniques, e.g. regression, are prone to failure or ill-prediction quality, as is frequently the case when the connection between the variables is complex, or even when there is missing information.
The central result of recursive partitioning is a "tree" a.k.a. "decision tree" or "graph", in which the data is organized (partitioned) into nodes (leaves) along branches; data which is more similar according to some criteria tend to be localized into the same nodes, which more dissimilar data tend to occupy different nodes. The statistical significance of the "split" of the data into the nodes can be placed on a more quantitative footing by computing p-values, which discern the quality of a split relative to a random event, and provides the value-added component to the data.
For more information email info@recursivepartitioning.com