CONSTRUCTION OF DECISION LOGIC WITH GRAPHS

• US 20090058859A1
• Filed: 08/29/2008
• Published: 03/05/2009
• Est. Priority Date: 08/31/2007
• Status: Active Grant

• Current Assignee: Fair Isaac Corporation
• Original Assignee: Fair Isaac Corporation
• Inventors: Erickson, Chris, Thorsen, Megan, Steele, Michael, Tolmanov, Sergei, Kumar, Prasun, Crawford, Stuart L.
• Granted Patent: US 8,200,609 B2
• Time in Patent Office: Days
• US Class Current: 345/440
• CPC Class Codes: G06F 8/34 Graphical or visual programming

Abstract

Data characterizing a plurality of related action graphs is received. Thereafter, the, plurality of related action graphs are transformed into a logically equivalent structure so that rendering of the logically equivalent structure can be initiated. Related interfaces, apparatus, systems, techniques and articles are also described.

Claims

1. An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:

receiving data characterizing a plurality of related action graphs;

transforming the plurality of related action graphs into a logically equivalent structure; and

initiating rendering of the logically equivalent structure.

2. An article as in claim 1, wherein the logically equivalent structure is a decision tree.

3. An article as in claim 1, wherein the logically equivalent structure is a directed acyclic graph.

4. An article as in claim 1, wherein the logically equivalent structure is an exception-based directed acyclic graph.

5. An article as in claim 1, wherein the transforming comprises:

detecting one or more cases in which there is no corresponding assigned action.

6. An article as in claim 1, wherein the transforming comprises:

detecting one or more cases in which there are two or more corresponding assigned actions.

7. An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:

removing action nodes from all of two or more action graphs and combining the logic of these graphs to form a union graph;

creating a true graph having true nodes for each variable in the union graph;

subtracting the union graph from the true graph to result in a gap graph; and

presenting the gap graph to a user.

8. An article as in claim 7, wherein the tangible machine-readable storage medium further embodies instructions that when performed by one or more machines result in operations comprising:

receiving user-generated input via a graphical user interface assigning a single action to the gap identified in the gap graph.

9. An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:

combining decision logic of two or more action graphs;

generating a list of overlapping action sets based on leaf nodes in the combined logic having more than one action; and

presenting the list of overlapping action sets to a user.

10. An article as in claim 9, wherein the tangible machine-readable storage medium further embodies instructions that when performed by one or more machines result in operations comprising:

receiving user-generated input via a graphical user interface assigning a single action to each overlap identified in the list of overlapping action sets.

11. An article comprising a tangible machine-readable storage medium embodying instructions that when performed by one or more machines result in operations comprising:

receiving user-generated input via a graphical user interface generating or modifying a hierarchical decision logic structure;

visually identifying gaps or overlaps in the hierarchical decision logic structure;

receiving user-generated input correcting any gaps or overlaps; and

finalizing generation of the hierarchical decision logic structure.

12. An article as in claim 11, wherein the hierarchical decision logic structure is a directed acyclic graph.

13. An article as in claim 12, wherein the gaps are defined by conditions for which there is no path in the directed acyclic graph leading from a start node to an action node.

14. An article as in claim 12, wherein the overlaps are defined by conditions for which there are two or more paths in the directed acyclic graph leading from a start node connecting to different action nodes.

15. An article as in claim 11, wherein the hierarchical decision logic structure is an exception-based directed acyclic graph.

16. An article as in claim 15, wherein the overlaps are defined by conditions for which there are two or more paths in the exception-based directed acyclic graph leading from a start node and connecting to different action nodes.