Approximating Decision Trees with Multiway Branches
From MaRDI portal
Publication:3638036
DOI10.1007/978-3-642-02927-1_19zbMath1248.68553OpenAlexW1565530450MaRDI QIDQ3638036
Venkatesan T. Chakaravarthy, Sambuddha Roy, Yogish Sabharwal, Vinayaka Pandit
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_19
Approximation algorithms (68W25) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Decision trees for function evaluation: simultaneous optimization of worst and expected cost ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ Average-Case Active Learning with Costs
This page was built for publication: Approximating Decision Trees with Multiway Branches
