Methods and systems for automatically identifying and selecting preferred size classification and regression trees are disclosed. The invention is used to identify a specific decision tree or group of preferred size trees that are consistent across train and test samples in node-specific details that are often important to decision makers. Specifically, for a tree to be identified as preferred by this system, the train and test samples must both agree on key measures for every terminal node of the tree. In addition to this node-by-node criterion, an additional tree selection method may be imposed. Accordingly, the train and test samples rank order the nodes on a relevant measure in the same way. Both consistency criteria may be applied in a fuzzy manner in which agreement must be close but need not be exact.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A method implemented on a general purpose computer with processor-executable program instructions configured to direct at least one processor and at least one stored data table including data useful for predictive analysis, for automatically selecting a preferred size tree or sub-tree among a plurality of trees, comprising: accessing a stored data table comprising a plurality of records and a plurality of columns; identifying a training set of records and a test set of records within the data table records; analyzing the training set to grow or prune a collection of at least one fitted tree or sub-tree, each tree or sub-tree having at least one node, at least one node of each tree or sub-tree being a terminal node; determining the training set records associated with each node of each tree or sub-tree; determining the test set records associated with each node of each tree or sub-tree; determining at least one node decision criterion useful to examine a distribution in data of at least one attribute; determining a distribution in data of at least one attribute for each node of each tree or sub-tree, the data including at least one of: train data, test data, validation data, or historical data; determining at least one lift ratio threshold; determining at least one prediction for each node of each tree or sub-tree as a function of at least one node decision criterion and a distribution in data of at least one attribute, the data including at least one of: train data, test data, validation data, or historical data; calculating test set lift ratio and training set lift ratio for each node of each tree or sub-tree as a function of: at least one prediction made in each node, and at least one node decision criterion; determining a direction agreement statistic and a rank match statistic associated with each node of each tree or sub-tree; analyzing the direction agreement statistic and the rank match statistic for each node of each tree or sub-tree for two or more of: training set records, test set records, validation set records, or historical records; determining for each node of each tree or sub-tree, for training set records and test set records, direction agreement and rank match agreement, in accordance with at least one of: an exact match or a fuzzy match, the direction agreement and rank match agreement determined as a function of: at least one lift ratio, at least one lift ratio threshold, at least one direction agreement statistic, and at least one rank match statistic; identifying zero or more of a preferred tree or sub-tree based on the step of determining direction agreement and rank match agreement; selecting as a preferred size tree or sub-tree the largest preferred tree or sub-tree satisfying both direction agreement and rank match agreement that is no larger than the best performing tree or sub-tree; and upon selection of at least one preferred size tree or sub-tree, providing access to a decision maker to at least one preferred size tree or sub-tree for generating predictive analytic output as a function of input data, wherein selection of at least one preferred size tree or sub-tree is based on: direction agreement and rank match agreement, tree or sub-tree performance, and tree or sub-tree size. 2. The method of claim 1 wherein the direction agreement statistic is determined in accordance with a technique selected from the group consisting of differences of means, trimmed means, medians, proportions, lifts using associated z-scores, and lifts using t-statistics. 3. The method of claim 2 wherein the z-scores and t-statistics are adjusted for a plurality of simultaneous comparisons to allow for a false discovery rate. 4. The method of claim 2 wherein the z-scores and t-statistics are adjusted for a plurality of simultaneous comparisons to allow for conventional Bonferroni adjustment. 5. The method of claim 1 wherein the step of identifying zero or more of a preferred tree or sub-tree is based on a number of terminal nodes displaying divergences above predetermined thresholds. 6. The method of claim 1 wherein the step of identifying zero or more of a preferred tree is based on a degree of mismatching of the rank match statistic. 7. The method of claim 1 wherein the step of identifying zero or more of a preferred tree or sub-tree is based on a number of nodes mismatching on the rank match statistic. 8. The method of claim 1 wherein the steps of determining a direction agreement statistic and a rank match statistic and analyzing the direction agreement statistic and the rank match statistic for each node of each tree or sub-tree are performed on only terminal nodes. 9. The method of claim 1 wherein the step of determining a direction agreement statistic and a rank match statistic associated with each node of each tree or sub-tree is performed using a validation set of records. 10. The method of claim 1 wherein the preferred tree or sub-tree is for identifying marketing prospects for a targeted marketing campaign. 11. The method of claim 1 wherein the preferred tree or sub-tree is for credit risk scoring and the terminal nodes of the preferred tree represent credit risk grades. 12. A system for automatically selecting zero or more of a preferred size tree or sub-tree among a plurality of trees, comprising: one or more processor; and a memory that is not a transitory propagating signal, the memory connected to one or more processor and encoding computer readable instructions, including processor executable program instructions, the computer readable instructions accessible to the one or more processor, wherein the processor executable program instructions, when executed by one or more processor, cause one or more processor to perform operations comprising: access a stored data table comprising a plurality of records and a plurality of columns; identify a training set of records and a test set of records within the data table records; analyze the training set to grow or prune a collection of at least one fitted tree or sub-tree, each tree or sub-tree having at least one node, at least one node of each tree or sub-tree being a terminal node; determine the training set records associated with each node of each tree or sub-tree; determine the test set records associated with each node of each tree or sub-tree; determine at least one node decision criterion useful to examine a distribution in data of at least one attribute; determine a distribution in data of at least one attribute for each node of each tree or sub-tree, the data including at least one of: train data, test data, validation data, or historical data; determine at least one lift ratio threshold; determine at least one prediction for each node of each tree or sub-tree as a function of at least one node decision criterion and a distribution in data of at least one attribute, the data including at least one of: train data, test data, validation data, or historical data; calculate test set lift ratio and training set lift ratio for each node of each tree or sub-tree as a function of: at least one prediction made in each node, and at least one node decision criterion; determine a direction agreement statistic and a rank match statistic associated with each node of each tree or sub-tree; analyze the direction agreement statistic and the rank match statistic for each node of each tree or sub-tree for two or more of: training set records, test set records, validation set records, or historical records; determine for each node of each tree or sub-tree, for training set records and test set records, direction agreement and rank match agreement, in accordance with at least one of: an exact match or a fuzzy match, the direction agreement and rank match agreement determined as a function of: at least one lift ratio, at least one lift ratio threshold, at least one direction agreement statistic, and at least one rank match statistic; identify zero or more of a preferred tree or sub-tree based on the step of determining direction agreement and rank match agreement; selecting as a preferred size tree or sub-tree the largest preferred tree or sub-tree satisfying both direction agreement and rank match agreement that is no larger than the best performing tree or sub-tree; and upon selection of at least one preferred size tree or sub-tree, provide access to a decision maker to at least one preferred size tree or sub-tree for generating predictive analytic output as a function of input data, wherein selection of at least one preferred size tree or sub-tree is based on: direction agreement and rank match agreement, tree or sub-tree performance, and tree or sub-tree size. 13. The system of claim 12 wherein the instructions direct the processor to determine the direction agreement statistic in accordance with a technique selected from the group consisting of: differences of means, trimmed means, medians, proportions, lifts using associated z-scores, and lifts using t-statistics. 14. The system of claim 13 wherein the z-scores and t-statistics are adjusted for a plurality of simultaneous comparisons to allow for a false discovery rate. 15. The system of claim 13 wherein the z-scores and t-statistics are adjusted for a plurality of simultaneous comparisons to allow for conventional Bonferroni adjustment. 16. The system of claim 12 wherein the instructions direct the processor to identify zero or more of a preferred tree or sub-tree based on a number of terminal nodes displaying divergences above predetermined thresholds. 17. The system of claim 12 wherein the instructions direct the processor to identify zero or more of a preferred tree or sub-tree based on a degree of mismatching of the rank match statistic. 18. The system of claim 12 wherein the instructions direct the processor to identify zero or more of a preferred tree or sub-tree based on a number of nodes mismatching on the rank match statistic. 19. The system of claim 12 wherein the instructions direct the processor to determine an direction agreement statistic and a rank match statistic and analyze the direction agreement statistic and the rank match statistic for each terminal node of each tree. 20. The system of claim 12 wherein the instructions direct the processor to determine a direction agreement statistic and a rank match statistic associated with each node of each tree using a validation set of records.