On the decision tree depth

zbMATH Open0962.68519MaRDI QIDQ1593863FDOQ1593863

Authors: M. Yu. Moshkov 

Publication date: 28 January 2001

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• Publication:4892375
• 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

zbMATH Keywords

decision trees

Mathematics Subject Classification ID

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

Cited In (8)

• Title not available (Why is that?)
• The hardness of the expected decision depth problem
• Minimizing depth of decision trees with hypotheses
• Bounds on depth of decision trees derived from decision rule systems with discrete attributes
• On the hardness of the minimum height decision tree problem
• Relationships between Average Depth and Number of Misclassifications for Decision Trees
• Estimates for the depth of decision trees over finite two-valued systems of tests.
• SIZES OF ORDERED DECISION TREES

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)