Article and method for finding a compact representation to...

Data processing: artificial intelligence – Having particular user interface

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Reexamination Certificate

active

07937335

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.

REFERENCES:
B. Gaines, “Transforming Rules and Trees into Comprehensible Knowledge Structures”, Advances in Knowledge Discovery and Data Mining, 205-28, 1996.
R. Kohavi, “Bottom-Up Induction of Oblivious Read-Once Decision Graphs”, European Conf. on Mach. Learning, 1994, pages unknown.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Article and method for finding a compact representation to... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Article and method for finding a compact representation to..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Article and method for finding a compact representation to... will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2702339

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.