Approximating Decision Trees with Multiway Branches

DOI10.1007/978-3-642-02927-1_19MaRDI QIDQ3638036zbMATH OpenOpenAlexFDO

Authors Venkatesan T. Chakaravarthy, Vinayaka Pandit, Sambuddha Roy, Yogish Sabharwal

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

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Approximation algorithms (68W25)

Recommendations

• Decision trees for entity identification, approximation algorithms and hardness results
• Approximating optimal binary decision trees
• Approximating Optimal Binary Decision Trees
• On greedy algorithms for decision trees
• Rough Sets and Current Trends in Computing

Cited in

(14)

• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions
• A simple boosting algorithm using multi-way branching decision trees
• On the Huffman and alphabetic tree problem with general cost functions
• Decision tree classification with bounded number of errors
• On greedy algorithms for decision trees
• Decision trees for entity identification, approximation algorithms and hardness results
• Average-case active learning with costs
• scientific article; zbMATH DE number 2080650 (Why is no real title available?)
• MULTIPLICATIVE PROPERTIES IN EVALUATION OF DECISION TREES
• Partial order multiway search
• Approximating decision trees with priority hypotheses
• Approximating decision trees with priority hypotheses
• A simple approximation algorithm for optimal decision tree

This page was built for publication: Approximating Decision Trees with Multiway Branches

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