Inferring Reduced Ordered Decision Graphs of Minimum Description Length

Abstract We propose an heuristic algorithm that induces decision graphs from training sets using Rissanen's minimum description length principle to control the tradeoff between accuracy in the training set and complexity of the hypothesis description.

[1]  Jeffery A. Goldman.  Machine Learning: A Comparative Study of Pattern Theory and C4.5 , 1994 .

[2]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[3]  Ronald L. Rivest,et al.  Inferring Decision Trees Using the Minimum Description Length Principle , 1989, Inf. Comput..

[4]  Jonathan J. Oliver.  Decision Graphs - An Extension of Decision Trees , 1993 .

[5]  Srinivas Devadas.  Comparing two-level and ordered binary decision diagram representations of logic functions , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD 1993.

[7]  J. Rissanen,et al.  Modeling By Shortest Data Description* , 1978, Autom..

[8]  Robert K. Brayton,et al.  Multilevel logic synthesis , 1990, Proc. IEEE.

[9]  Kenneth J. Supowit,et al.  Finding the Optimal Variable Ordering for Binary Decision Diagrams , 1987, 24th ACM/IEEE Design Automation Conference.

[10]  Ron Kohavi,et al.  Oblivious Decision Trees, Graphs, and Top-Down Pruning , 1995, IJCAI.

[11]  J. Ross Quinlan,et al.  An Empirical Comparison of Genetic and Decision-Tree Classifiers , 1988, ML.

[12]  Cullen Schaffer,et al.  A Conservation Law for Generalization Performance , 1994, ICML.

[13]  Robert K. Brayton,et al.  Multi-Valued Decision Diagrams , 1990 .

[14]  Alberto L. Sangiovanni-Vincentelli,et al.  Learning Complex Boolean Functions: Algorithms and Applications , 1993, NIPS.

[15]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[16]  J. Ross Quinlan,et al.  Learning Efficient Classification Procedures and Their Application to Chess End Games , 1983 .

[17]  Sebastian Thrun,et al.  The MONK''s Problems-A Performance Comparison of Different Learning Algorithms, CMU-CS-91-197, Sch , 1991 .

[18]  Arlindo Manuel Olveira.  Inductive learning by selection of minimal complexity representations , 1994 .

[19]  J. J. Mahoney,et al.  Initializing ID5R with a Domain Theory: Some Negative Results , 1991 .

[20]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[21]  Larry A. Rendell,et al.  Fringe-Like Feature Construction: A Comparative Study and a Unifying Scheme , 1991, ML.

[22]  Shuzo Yajima,et al.  The Complexity of the Optimal Variable Ordering Problems of Shared Binary Decision Diagrams , 1993, ISAAC.

[23]  Ron Kohavi,et al.  Bottom-Up Induction of Oblivious Read-Once Decision Graphs: Strengths and Limitations , 1994, AAAI.

[24]  Richard Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, ICCAD.