A note on the comparison of five heuristic optimization techniques of a certain class of decision trees

DOI10.1016/0020-0255(91)90059-4zbMath0714.68098OpenAlexW2061892375MaRDI QIDQ751318

Nicholas V. Findler, Laurie H. Ihrig, Timothy W. Bickmore, Wai- Wan Tsang

Publication date: 1991

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(91)90059-4

zbMATH Keywords

decision treesheuristic optimization techniqueslarge-scale programming systems

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Constructing optimal binary decision trees is NP-complete
• On the complexity of decision trees, the quasi-optimizer, and the power of heuristic rules
• Unnamed Item

This page was built for publication: A note on the comparison of five heuristic optimization techniques of a certain class of decision trees