Optimizing decision trees through heuristically guided search

Optimal decision table conversion has been tackled in the literature using two approaches, dynamic programming and branch-and-bound. The former technique is quite effective, but its time and space requirements are independent of how “easy” the given table is. Furthermore, it cannot be used to produce good, quasioptimal solutions. The branch-and-bound technique uses a good heuristic to direct the search, but is cluttered up by an enormous search space, since the number of solutions increases with the number of test variables according to a double exponential. In this paper we suggest a heuristically guided top-down search algorithm which, like dynamic programming, recognizes identical subproblems but which can be used to find both optimal and quasioptimal solutions. The heuristic search method introduced in this paper combines the positive aspects of the above two techniques. Compressed tables with a large number of variables can be handled without deriving expanded tables first.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  P. B. Coaker,et al.  Applied Dynamic Programming , 1964 .

[3]  Edward J. McCluskey,et al.  Introduction to the theory of switching circuits , 1965 .

[4]  E. L. Lawler,et al.  Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[5]  Lewis T. Reinwald,et al.  Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time , 1966, JACM.

[6]  Nils J. Nilsson,et al.  Searching problem-solving and game-playing trees for minimal cost solutions , 1968, IFIP Congress.

[7]  Ugo Montanari,et al.  Heuristically Guided Search and Chromosome Matching , 1970, Artif. Intell..

[8]  W. W. Bledsoe,et al.  Review of "Problem-Solving Methods in Artificial Intelligence by Nils J. Nilsson", McGraw-Hill Pub. , 1971, SGAR.

[9]  Nils J. Nilsson,et al.  Problem-solving methods in artificial intelligence , 1971, McGraw-Hill computer science series.

[10]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[11]  A. J. Bayes.  A Dynamic Programming Algorithm to Optimise Decision Table Code , 1973, Aust. Comput. J..

[12]  Udo W. Pooch,et al.  Translation of Decision Tables , 1974, ACM Comput. Surv..

[13]  U. Montanari,et al.  On the Foundations of Dynamic Programming , 1975 .

[14]  Alberto Martelli,et al.  Form Dynamic Programming To Search Algorithms With Functional Costs , 1975, IJCAI.

[15]  Kenneth C. Sevcik,et al.  The synthetic approach to decision table conversion , 1976, CACM.

[16]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..