Approximating decision trees with value dependent testing costs
From MaRDI portal
Publication:2345858
Recommendations
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- Weighted decision trees where the cost of a test depends on its outcome
- On the competitive ratio of evaluating priced functions
- Approximating Optimal Binary Decision Trees
- Approximating optimal binary decision trees
Cites work
- Approximating Optimal Binary Decision Trees
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- Average-case active learning with costs
- Greedy algorithm with weights for decision tree construction
- Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
- scientific article; zbMATH DE number 2185610 (Why is no real title available?)
- On greedy algorithms for decision trees
- On the hardness of the minimum height decision tree problem
- Optimal Binary Identification Procedures
Cited in
(8)- Decision trees for function evaluation: simultaneous optimization of worst and expected cost
- Correction to: ``Trading off worst and expected cost in decision tree problems
- Reducing complexity of decision trees with two variable tests
- Weighted decision trees where the cost of a test depends on its outcome
- scientific article; zbMATH DE number 6262887 (Why is no real title available?)
- Approximating decision trees with priority hypotheses
- Approximating decision trees with priority hypotheses
- Heuristic least-cost computation of discrete classification functions with uncertain argument values
This page was built for publication: Approximating decision trees with value dependent testing costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345858)
