Approximating decision trees with priority hypotheses

DOI10.1007/978-3-031-49190-0_4MaRDI QIDQ6591456zbMATH OpenFDO

Authors Jing Yuan, Shaojie Tang

Publication date 22 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49190-0_4

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)

Recommendations

• Approximating decision trees with priority hypotheses
• Approximating Decision Trees with Multiway Branches
• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• Approximating decision trees with value dependent testing costs
• Algorithms for the unit-cost stochastic score classification problem

Cites work

• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• Approximating decision trees with value dependent testing costs
• Decision trees for entity identification, approximation algorithms and hardness results

Cited in

(1)

• Approximating decision trees with priority hypotheses

This page was built for publication: Approximating decision trees with priority hypotheses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6591456)