Article and method for finding a compact representation to visualize complex decision trees

A computer implemented method comprising:

• transforming a decision tree for determining whether a particular type of credit card should be issued to a person into an optimal compact representation, the decision tree having a plurality of variables, a root node, intermediate nodes, and leaf nodes;
• and
• displaying the optimal compact representation of the decision tree;
• wherein the transforming comprises:
• converting the decision tree to a collection of independent decision chains, the independent decision chains being paths from the root node to a leaf node such that each node, except the root node, has a single parent and each node, except a leaf node, has a single child node.

A computer-implemented method comprising:

• transforming a decision tree into a directed acyclic graph, the decision tree having a plurality of variables, a root node, intermediate nodes, and leaf nodes, at least a portion of the nodes defining at least three conditions;
• transforming the directed acyclic graph into an exception-based directed acyclic graph with a single exception to result in an optimal compact representation of the decision tree;
• and
• displaying the optimal compact representation of the decision tree.