Color-coded visual comparison of decision logic

• US 8,266,090 B2
• Filed: 08/29/2008
• Issued: 09/11/2012
• Est. Priority Date: 08/31/2007
• Status: Active Grant

• Current Assignee: Fair Isaac Corporation
• Original Assignee: Fair Isaac Corporation
• Inventors: Crawford, Stuart L., Steele, Michael, Doshi, Navin, Tolmanov, Sergei, Kolipaka, Kashyap Babu Rao, Chhaparwal, Gaurav, Thorsen, Megan, Erickson, Chris
• Primary Examiner(s): Gaffin, Jeffrey A
• Assistant Examiner(s): KENNEDY, ADRIAN L
• Application Number:
  US12/201,555
• Publication Number:
  US 20090063389A1
• Time in Patent Office: 1,474 Days
• Field of Search: None
• 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 color-coded 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 non-transitory 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, the third form of decision logic being selected from a group consisting of;

decision tree, a directed acyclic graph and an exception-based directed acyclic graph;

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, the visual representation being color-coded to indicate the differences and similarities between 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 leveled.

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

4. The article of claim 2, 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.

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

6. A method for implementation by one or more data processors comprising:

receiving, by at least one data processor, 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, by at least one data processor, the first set of linked nodes to a logically equivalent first modified set of linked nodes arranged in a third form of decision logic, the third form of decision logic being selected from a group consisting of;

decision tree, a directed acyclic graph and an exception-based directed acyclic graph;

converting, by at least one data processor, 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, by at least one data processor, a visual representation of the first modified set of linked nodes and the second modified set of linked nodes, the visual representation being color-coded to indicate the differences and similarities between the first modified set of linked nodes and the second modified set of linked nodes.

7. The method of claim 6, wherein the third form of decision logic is leveled.

8. The method of claim 7, wherein an order of levels in the third form of decision logic is configurable by a user.

9. The method of claim 7, 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.

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

11. A system comprising:

one or more data processors;

memory storing instructions, which when executed by at least one data processor, 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, the third form of decision logic being selected from a group consisting of;

decision tree, a directed acyclic graph and an exception-based directed acyclic graph;

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, the visual representation being color-coded to indicate the differences and similarities between the first modified set of linked nodes and the second modified set of linked nodes.

12. The system of claim 11, wherein the third form of decision logic is leveled.

13. The system of claim 12, wherein an order of levels in the third form of decision logic is configurable by a user.

14. The method of claim 12, 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.

15. The system of claim 11, wherein the third form of decision logic is read-once.