On greedy algorithms for decision trees
From MaRDI portal
Recommendations
Cited in
(17)- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- Trading off worst and expected cost in decision tree problems
- The binary identification problem for weighted trees
- Approximating decision trees with value dependent testing costs
- Approximating optimal binary decision trees
- Constrained binary identification problem
- Decision trees for entity identification, approximation algorithms and hardness results
- Approximating Optimal Binary Decision Trees
- Approximating Decision Trees with Multiway Branches
- Improved approximation algorithms for the average-case tree searching problem
- Searching for quicksand ideals in partially ordered sets
- scientific article; zbMATH DE number 2209400 (Why is no real title available?)
- On the complexity of searching in trees and partially ordered structures
- Partial order multiway search
- A simple approximation algorithm for optimal decision tree
- An efficient search strategy for hidden ideals in pointed partially ordered sets
- Decision trees with short explainable rules
This page was built for publication: On greedy algorithms for decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3060774)