On the decision tree depth

MaRDI QIDQ1593863zbMATH OpenFDO

Authors M. Yu. Moshkov

Publication date 28 January 2001

Published in Doklady Mathematics (Search for Journal in Brave)

zbMATH Keywords

decision trees

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 927106
• scientific article; zbMATH DE number 1098497
• scientific article; zbMATH DE number 1455626
• scientific article; zbMATH DE number 741345
• scientific article; zbMATH DE number 1983159
• scientific article; zbMATH DE number 1810489
• Minimizing depth of decision trees with hypotheses
• Bounds on the depth of decision trees that compute Boolean functions
• Relationships between Average Depth and Number of Misclassifications for Decision Trees

Cited in

(11)

• On the hardness of the minimum height decision tree problem
• Minimizing depth of decision trees with hypotheses
• SIZES OF ORDERED DECISION TREES
• Estimates for the depth of decision trees over finite two-valued systems of tests.
• scientific article; zbMATH DE number 1098497 (Why is no real title available?)
• scientific article; zbMATH DE number 1455624 (Why is no real title available?)
• scientific article; zbMATH DE number 927106 (Why is no real title available?)
• On Polynomial Time Constructions of Minimum Height Decision Tree
• Relationships between Average Depth and Number of Misclassifications for Decision Trees
• Bounds on depth of decision trees derived from decision rule systems with discrete attributes
• The hardness of the expected decision depth problem

This page was built for publication: On the decision tree depth

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