Article and method for finding a compact representation to visualize complex decision trees
US7937335B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Aug 10, 2010 |
| Grant date | May 3, 2011 |
| Priority date | — |
| Expiry date | Aug 10, 2030 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/904
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
The invention comprises an article and method for transforming a complex or large decision tree having multiple variables; multiple values for each variable; and, multiple outcomes for each combination of variables and their associated values, into a compact, efficient graphical representation to provided enhanced ease of use and interaction by a human user. More particularly, the invention comprises a computationally efficient method for transforming an input decision tree into an optimal compact representation by computing a particular ordering of variables in the decision tree that first leads to a Directed Acyclic Graph, or “DAG,” with a minimum number of nodes. The method then converts the DAG into an exception-based DAG, or “EDAG,” with exactly one exception, having an optimal, minimum number of nodes with increased comprehensibility for a user.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.