×

Cascade boosting of predictive models

  • US 6,546,379 B1
  • Filed: 10/26/1999
  • Issued: 04/08/2003
  • Est. Priority Date: 10/26/1999
  • Status: Expired due to Fees
First Claim
Patent Images

1. A computer implemented method of boosting of predictive models that apply subordinate models to data points in mutually exclusive segments, called cascade boosting, for resolving an interpretability problem of previous boosting methods, while mitigating a fragmentation problem when applied to decision trees, said method comprising the steps:

  • (a) building an initial predictive model, which initially is a current model, that applies at least one subordinate model to a plurality of data points in mutually exclusive segments, the initial predictive model being built from an initial population of training data points;

    (b) observing performance of the current model, which is initially the initial predictive model, when applied to each mutually exclusive segment of a current population of observing data points, which is initially either the initial population of training data points or a separate initial population of data points reserved for observing performance;

    (c) applying statistical learning theory to derive a reliable estimate bounding future performance of the current model on each mutually exclusive segment, the reliable estimate being derived for each mutually exclusive segment from the observed performance together with a number of observing data points falling within a mutually exclusive segment;

    (d) sorting mutually exclusive segments by estimates;

    (e) selecting and retaining a fraction of the mutually exclusive segments, and also retaining each subordinate model associated with the mutually exclusive segment, the selection resulting in retention of segments with better estimates;

    (f) forming a subpopulation of training points by sampling from the current population of training points so as to exclude, either with certainty or with high probability, each point falling within the selected and retained segments;

    (g) forming a subpopulation of observing data points by sampling from the current population of observing data points so as to exclude, either with certainty or with high probability, each point falling within the selected and retained segments;

    (h) building another predictive model which becomes the current model, the current model applying at least one subordinate model to a plurality of data points in mutually exclusive segments, and being built from the subpopulation of training points formed in step (f);

    (i) repeating steps (b) to (h) a desired number of times, with the subpopulation of training points as the current population of training points and with the subpopulation of observing data points as the current population of observing data points;

    (j) arranging selected and retained mutually exclusive segments having better estimates in an open-ended decision list, where each item in the open-ended decision list specifies a test for membership in one of the selected and retained segments having better estimates and specifies that, if a point passes the membership test, then a prediction for the point is to be obtained by using the prediction of the subordinate model corresponding to the retained mutually exclusive segment; and

    (k) terminating the open-ended decision list with one of the models built in step (a) or step (h) and resulting in a terminated decision list, thereby solving the problem of model interpretability while mitigating the fragmentation problem.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×