Comparison of Decision Logic

• US 20090063389A1
• 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: Rao Kolipaka, Kashy Ap, Doshi, Navin, Chhaparwal, Gaurav, Steele, Michael, Tolmanov, Sergei, Crawford, Stuart L.
• Granted Patent: US 8,266,090 B2
• Time in Patent Office: Days
• US Class Current: 706/52
• CPC Class Codes: G06N 7/00 Computing arrangements based on specific mathematical models

Abstract

A request to compare strategies is received. The first strategy can be graphically represented by a first set of linked nodes arranged in a first form of decision logic. The second strategy can be graphically represented by a second set of linked nodes arranged in a second form of decision logic. The first set of linked nodes can be converted to a first modified set of linked nodes arranged in a third form of decision logic. The second set of linked nodes can be converted to a second modified set of linked nodes arranged in the third form of decision logic. A visual representation of the first modified set of linked nodes and the second modified set of linked nodes can be provided to a user. Related apparatus, 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 a request to compare a first strategy to a second strategy, the first strategy graphically represented by a first set of linked nodes arranged in a first form of decision logic, the second strategy graphically represented by a second set of linked nodes arranged in a second form of decision logic;

converting the first set of linked nodes to a logically equivalent first modified set of linked nodes arranged in a third form of decision logic;

converting the second set of linked nodes to a logically equivalent second modified set of linked nodes arranged in the third form of decision logic; and

,

simultaneously displaying a visual representation of the first modified set of linked nodes and the second modified set of linked nodes.

2. The article of claim 1, wherein the third form of decision logic is selected from the group consisting of a decision tree, a directed acyclic graph and an exception-based directed acyclic graph.

3. The article of claim 2, wherein the third form of decision logic is leveled.

4. The article of claim 3, wherein an order of levels in the third form of decision logic is configurable by a user.

5. The article of claim 3, wherein an order of levels in the third form of decision logic is selected to minimize a number of linked nodes in at least one of the first modified set of linked nodes and the second modified set of linked nodes.

6. The article of claim 2, wherein the third form of decision logic is read-once.

7. The article of claim 2, wherein the visual representation is color-coded to indicate the differences and similarities between the first modified set of linked nodes and the second modified set of linked nodes.

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

receiving a request to compare a first strategy to a second strategy from a user;

generating a first action graph corresponding to a first action node within the first strategy;

generating a second action graph corresponding to a second action node within the second strategy; and

,

simultaneously displaying a visual representation of the first action graph and the second action graph.

9. The article of claim 8, wherein the first action node and the second action node are selected by the user.

10. The article of claim 9, wherein the first action node and the second action node correspond to the same action.

11. The article of claim 8, wherein the visual representation is color-coded to indicate the differences and similarities between the simultaneously displayed action graphs.

12. The article of claim 8, wherein at least one of the simultaneously displayed action graphs is leveled.

13. The article of claim 12, wherein an order of levels in at least one of the simultaneously displayed action graphs is configurable by a user.

15. The article of claim 12, wherein an order of levels is selected to minimize a number of linked nodes in the at least one of the action graphs.

16. The article of claim 8, wherein at least one of the simultaneously displayed action graphs is a read-once action graph.

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

receiving a request to compare a first strategy to a second strategy from a user;

identifying a first segment corresponding to a first action selected from the first strategy;

identifying a second segment corresponding to a second action selected from the second strategy;

generating an intersection segment corresponding to the intersection of the first segment and the second segment;

generating a cross pair graph corresponding to the intersection segment; and

initiating rendering of the cross pair graph.

18. The article of claim 17, wherein the cross pair graph is leveled.

19. The article of claim 17, wherein the cross pair graph is read-once.

20. The article of claim 17, wherein the first action and the second action are selected from a crosstabulation table.

21. The article of claim 20, wherein the cross pair graph is generated for each combination of the first action and the second action selected from the crosstabulation table.

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

receiving a first tree and a second tree, each tree comprising at least one leaf node, the at least one leaf node assigning a population subset to an action;

for each leaf node of the first tree and its corresponding population subset, generating a sub-tree representing a logical treatment of the corresponding population subset by the second tree;

constructing a diff tree by attaching a corresponding sub-tree to each leaf node of the first tree; and

,

initiating rendering of the diff tree.

23. The article of claim 22, wherein the diff tree is color coded.