Finding small equivalent decision trees is hard

International Journal of Foundations of Computer Science

Volumn 11, Issue 2, 2000, Pages 343-354

  Zantema, Hans ^a   Bodlaender, Hans L ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

boolean functions; Decision trees; NP completeness

Indexed keywords

EID: 0041918830     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054100000193     Document Type: Article

References (19)

1. BOLLIG, B., AND WEGENER, I. Improving the variable ordering of OBDDs is NPcomplete. IEEE Transactions on Computers 4$ (1996), 993-1002.
2. BRESLOW, L. A., AND AHA, D. W. Simplifying decision trees: A survey. The Knowledge Engineering Review 12, 1 (1997), 1-40.
3. BRYANT, R. E. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers C-35, 8 (1986), 677-691.
4. COCKETT, J. R. B. Discrete decision theory: Manipulations. Theoretical Computer Science 54 (1987), 215-236.
5. COCKETT, J. R. B., AND HERRERA, J. A. Decision tree reduction. Journal of the Association for Computing Machinery 37, 4 (1990), 815-842.
6. FRIEDMAN, S., AND SUPOWIT, K. Finding the optimal variable ordering for binary decision diagrams. IEEE Transactions on Computers 39 (1990), 710-713.
7. GAREY, M., AND JOHNSON, D. Computers and Intractability. Freeman, 1979.
8. GUIJARRO, D., LAVIN, V., AND RAGHAVAN, V. Exact learning when irrelevant variables abound. In Proceedings of the 4th European Conference on Computational Learning Theory (1999), P. Fisher and H. U. Simon, Eds., vol. 1572 of Lecture Notes in Artificial Intelligence, Springer, pp. 91-100.
9. HANCOCK, T., JIANG, T., LI, M., AND TROMP, J. Lower bounds on learning decision lists and trees. Information and Computation 126 (1996), 114-122.
10. HYAFIL, L., AND RlVEST, R. L. Constructing optimal binary decision trees is NPcomplete. Information Processing Letters 5, 1 (1976), 15-17.
11. MEINEL, C., AND THEOBALD, T. Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications. Springer, 1998.
12. MITCHELL, T. M. Machine Learning. McGraw-Hill, 1997.
13. MORET, B. M. E. Decision trees and diagrams. Computing Surveys 14, 4 (1982), 593-623.
14. QuiNLAN, J. R. Induction of decision trees. Machine Learning 1 (1986), 81-106.
15. SUBRAMANIAN, G. H., NOSEK, J., RAGHUNATHAN, S. P ., AND KANITKAR, S. S. A comparison of the decision table and tree. Communications of the ACM 35, 1 (1992), 89-94.
16. VANTHIENEN, J. A more general comparison of the decision table and tree. Communications of the ACM 37, 2 (1994), 109-113.
17. ZANTEMA, H. Decision trees: Equivalence and propositional operations. In Pro ceedings 10th Netherlands/Belgium Conference on Artificial Intelligence (NAIC'98) (November 1998), H. L. Poutre and J. van den Herik, Eds., pp. 157-166. Extended version appeared as report UU-CS-1998-14, Utrecht University.
18. ZANTEMA, H., AND BODLAENDER, H. L. Finding small equivalent decision trees is hard. Tech. Rep. UU-CS-1999-02, Utrecht University, Department of Computer Science, January 1999. Available via http: //www. cs. uu. nl/docs/research/publication/TechRep. html.
19. ZANTEMA, H., AND BODLAENDER, H. L. Sizes of decision tables and decision trees. Tech. Rep. UU-CS-1999-31, Utrecht University, Department of Computer Science, 1999. Available via http: //www. cs. uu. nl/docs/research/publication/ TechRep. html.