SIZES OF ORDERED DECISION TREES

DOI10.1142/S0129054102001205zbMATH Open1066.68052OpenAlexW2017734938WikidataQ59567907 ScholiaQ59567907MaRDI QIDQ3021963FDOQ3021963

Authors: Hans Zantema, Hans L. Bodlaender 

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

Recommendations

• Growing decision trees in an ordinal setting
• scientific article; zbMATH DE number 2013257
• scientific article; zbMATH DE number 2101266
• Choice in ordered-tree-based decision problems
• On decision trees for orthants
• Sizes of trees in a random forest and configuration graphs
• Size of ordered binary decision diagrams representing threshold functions
• On trees and tree dimension of ordered sets
• On the decision tree depth

Mathematics Subject Classification ID

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

Cited In (2)

• A list-based compact representation for large decision tables management
• Title not available (Why is that?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021963)