Transforming predictive models

US9280740B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-9280740-B1
Application numberUS-201514594523-A
CountryUS
Kind codeB1
Filing dateJan 12, 2015
Priority dateJan 12, 2015
Publication dateMar 8, 2016
Grant dateMar 8, 2016

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

According to one embodiment of the present disclosure, a system for translating a boosting algorithm includes an interface communicatively coupled to a processor. The interface is operable to receive a trained boosting model. The processor is operable to identify a plurality of split-node variables associated with the trained boosting model. Each of the plurality of split-node variables comprises a variable name, a cutoff point, and a weight. The processor may aggregate the split-node variables by variable name and cutoff point and then combine the weights of each of the plurality of split-node variables having the same variable name and cutoff point. The processor may then create a linear model based on the combined variables.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for translating a boosting algorithm, comprising: receiving, at a hardware interface, a trained boosting model; identifying, using a processor communicatively coupled to the interface, a plurality of one-level, binary split-node variables associated with the trained boosting model, wherein each of the plurality of one-level, binary split-node variables comprises a variable name, a cutoff point, and a weight; identifying, using the microprocessor, a group of one-level, binary split-node variables that have the same variable name and cutoff point within the plurality of one-level, binary split-node variables; combining, using the processor, the weights of each of the one-level, binary split-node in the group of one-level, binary split-node variables to calculate a combined weight for the one-level, binary split-node variables in the group of one-level, binary split-node variables, wherein combining the weights comprises summing the weights of the one-level, binary split-node variables in the group of one-level, binary split-node variables; and creating, using the processor, a linear model based on the variable name, the cutoff point, and the combined weight. 2. The method of claim 1 , wherein the trained boosting model is one selected from the group comprising: Discrete Adaboost, Real Adaboost, Gentle Adaboost, and Logitboost. 3. The method of claim 1 , further comprising creating a performance scorecard based on the combined weight for the one-level, binary split-node variables. 4. The method of claim 1 , further comprising creating a model evaluation based on an error rate of the trained boosting model. 5. The method of claim 1 , further comprising creating a model evaluation based on a Kolmogorov-Smirnov test of the trained boosting model. 6. The method of claim 1 , wherein the linear model comprises conditional logic. 7. The method of claim 1 , wherein the linear model is in an if-then-else format. 8. A non-transitory computer readable storage medium comprising logic, the logic operable, when executed by a processor, to: receive a trained boosting model; identify a plurality of one-level, binary split-node variables associated with the trained boosting model, wherein each of the plurality of one-level, binary split-node variables comprise a variable name, a cutoff point, and a weight; identify a group of one-level, binary split-node variables that have the same variable name and cutoff point within the plurality of one-level, binary split-node variables; combine the weights of each of the one-level, binary split-node variables in the group of one-level, binary split-node variables to calculate a combined weight for the one-level, binary split node variables in the group of one-level, binary split node variables, wherein combining the weights comprises summing the weights of the one-level, binary split-node variables in the group of one-level, binary split-node variables; and create a linear model based on the variable name, the cutoff point, and the combined weight. 9. The non-transitory media of claim 8 , wherein the trained boosting model is one selected from the group comprising: Discrete Adaboost, Real Adaboost, Gentle Adaboost, and Logitboost. 10. The non-transitory media of claim 8 , further comprising creating a performance scorecard based on the combined weight for the one-level, binary split-node variables. 11. The non-transitory media of claim 8 , further comprising creating a model evaluation based on the error rate of the trained boosting model. 12. The non-transitory media of claim 8 , further comprising creating a model evaluation based on a Kolmogorov-Smirnov test of the trained boosting model. 13. The non-transitory media of claim 8 , wherein the linear model comprises conditional logic. 14. The non-transitory media of claim 8 , wherein the linear model is in an if-then-else format. 15. A system for translating a boosting algorithm, comprising: a hardware interface operable to: receive a trained boosting model; and a hardware processor operable to: identify a plurality of one-level, binary split-node variables associated with the trained boosting model, wherein each of the plurality of one-level, binary split-node variables comprises a variable name, a cutoff point, and a weight; identify a group of one-level, binary split-node variables that have the same variable name and cutoff point within the plurality of one-level, binary split-node variables; combine the weights of each of the one-level, binary split-node variables in the group of one-level, binary split-node variables to calculate a combined weight for the one-level, binary split-node variables in the group of one-level, binary split-node variables, wherein combining the weights comprises summing the weights of the one-level, binary split-node variables in the group of one-level, binary split-node variables; and create a linear model based on the variable name, the cutoff point, and the combined weight. 16. The system of claim 15 , wherein the trained boosting model is one selected from the group comprising: Discrete Adaboost, Real Adaboost, Gentle Adaboost, and Logitboost. 17. The system of claim 15 , further comprising creating a performance scorecard based on the combined weight for the one-level, binary split-node variables. 18. The system of claim 15 , wherein the processor is further operable to create model evaluation based on the error rate of the trained boosting model. 19. The system of claim 15 , wherein the processor is further operable to create a model evaluation based on a Kolmogorov-Smirnov test of the trained boosting model. 20. The system of claim 15 , wherein the linear model comprises conditional logic.

Assignees

Inventors

Classifications

  • Computer-aided design [CAD] · CPC title

  • Machine learning · CPC title

  • G06N5/022Primary

    Knowledge engineering; Knowledge acquisition · CPC title

  • G06N5/04Primary

    Inference or reasoning models · CPC title

  • Physics · mapped topic

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US9280740B1 cover?
According to one embodiment of the present disclosure, a system for translating a boosting algorithm includes an interface communicatively coupled to a processor. The interface is operable to receive a trained boosting model. The processor is operable to identify a plurality of split-node variables associated with the trained boosting model. Each of the plurality of split-node variables compris…
Who is the assignee on this patent?
Bank Of America
What technology area does this patent fall under?
Primary CPC classification G06N5/022. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Mar 08 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).