Decision trees: More theoretical justification for practical algorithms
From MaRDI portal
Recommendations
Cited in
(17)- On the boosting ability of top-down decision tree learning algorithms
- Decision trees with at most 19 vertices for knowledge representation
- Noise-tolerant Occam algorithms and their applications to learning decision trees
- Decision tree classification with bounded number of errors
- Application of decision tree algorithms in stamping processes
- Deciding under Ignorance: In Search of Meaningful Extensions of the Hurwicz Criterion to Decision Trees
- scientific article; zbMATH DE number 5927257 (Why is no real title available?)
- Structure and majority classes in decision tree learning
- Improved approximation of linear threshold functions
- scientific article; zbMATH DE number 1149435 (Why is no real title available?)
- Decision Trees with Hypotheses
- Half-spaces with influential variable
- Inductive Logic Programming
- scientific article; zbMATH DE number 5267104 (Why is no real title available?)
- On lookahead heuristic in decision tree learning
- Decision Tree Heuristics Can Fail, Even in the Smoothed Setting
- Regularized impurity reduction: accurate decision trees with complexity guarantees
This page was built for publication: Decision trees: More theoretical justification for practical algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464491)