On the decision tree depth
From MaRDI portal
Publication:1593863
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
Cited in
(8)- scientific article; zbMATH DE number 927106 (Why is no real title available?)
- 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)