SIZES OF ORDERED DECISION TREES

DOI10.1142/S0129054102001205zbMATH Open1066.68052OpenAlexW2017734938WikidataQ59567907 ScholiaQ59567907MaRDI QIDQ3021963

Hans L. Bodlaender, Hans Zantema

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001205

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Knowledge representation (68T30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• On decision trees for orthants 👍 👎
• Choice in ordered-tree-based decision problems 👍 👎
• On trees and tree dimension of ordered sets 👍 👎
• Size of ordered binary decision diagrams representing threshold functions 👍 👎
• On the decision tree depth 👍 👎
• Sizes of trees in a random forest and configuration graphs 👍 👎
• Growing decision trees in an ordinal setting 👍 👎

This page was built for publication: SIZES OF ORDERED DECISION TREES