论文信息 - Multi-stage Optimization of Decision Trees with Some Applications

Multi-stage Optimization of Decision Trees with Some Applications

In this chapter, we consider multi-stage optimization technique for decision trees and two of its applications: study of totally optimal (simultaneously optimal relative to a number of cost functions) decision trees for Boolean functions, and improvement of bounds on depth of decision trees for diagnosis of circuits.

[1] A. D. Korshunov,et al. Computational complexity of Boolean functions , 2012 .

[2] H. Buhrman,et al. Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[3] Edward F. Moore,et al. Gedanken-Experiments on Sequential Machines , 1956 .

[4] Mikhail Moshkov,et al. Time Complexity of Decision Trees , 2005, Trans. Rough Sets.

[5] Ronald L. Rivest,et al. On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..

[6] Richard D. Eldred. Test Routines Based on Symbolic Logical Statements , 1959, JACM.

[7] Igor Chikalov,et al. Totally optimal decision trees for Boolean functions , 2016, Discret. Appl. Math..

[8] Vijay Raghavan,et al. Exact Learning when Irrelevant Variables Abound , 1999, Inf. Process. Lett..

[9] Ronald L. Rivest,et al. Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[10] T. Koshy. Catalan Numbers with Applications , 2008 .

[11] Richard M. Karp,et al. Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[12] Igor Chikalov,et al. Diagnosis of constant faults in iteration-free circuits over monotone basis , 2014, Discret. Appl. Math..

[13] Randolph Church,et al. Nunmerical analysis of certain free distributive structures , 1940 .