Approximating Optimal Binary Decision Trees
Authors:
- 27 August 2008
- book chapter
- Published by Springer Nature
- p. 1-9
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Decision trees for entity identification2007
- Learnability and Automatizability2004
- Approximating Min Sum Set CoverAlgorithmica, 2004
- Searching in random partially ordered setsTheoretical Computer Science, 2004
- On an Optimal Split Tree Problem1999
- Decision Trees for Geometric ModelsInternational Journal of Computational Geometry & Applications, 1998
- Lower Bounds on Learning Decision Lists and TreesInformation and Computation, 1996
- Constructing optimal binary decision trees is NP-completeInformation Processing Letters, 1976
- Performance bounds on the splitting algorithm for binary testingActa Informatica, 1974
- Optimal Binary Identification ProceduresSIAM Journal on Applied Mathematics, 1972