Approximating Optimal Binary Decision Trees

DOI10.1007/978-3-540-85363-3_1MaRDI QIDQ3541782zbMATH OpenOpenAlexFDO

Authors Brent Heeringa, Micah Adler

Publication date 27 November 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85363-3_1

Mathematics Subject Classification ID

Approximation algorithms (68W25)

Recommendations

• Approximating optimal binary decision trees
• On the hardness of the minimum height decision tree problem
• On greedy algorithms for decision trees
• Greedy algorithm with weights for decision tree construction
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

Cited in

(23)

• Performance bounds for binary testing with arbitrary weights
• Decision trees for function evaluation: simultaneous optimization of worst and expected cost
• On the hardness of the minimum height decision tree problem
• Algorithms for optimal dyadic decision trees
• The maximum binary tree problem
• On the Huffman and alphabetic tree problem with general cost functions
• Approximating decision trees with value dependent testing costs
• Approximating optimal binary decision trees
• scientific article; zbMATH DE number 1700378 (Why is no real title available?)
• On greedy algorithms for decision trees
• Decision trees for entity identification, approximation algorithms and hardness results
• Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
• Approximating Decision Trees with Multiway Branches
• Average-case active learning with costs
• Weighted decision trees where the cost of a test depends on its outcome
• Improved approximation algorithms for the average-case tree searching problem
• Hardness and inapproximability of minimizing adaptive distinguishing sequences
• Approximation algorithms for optimal decision trees and adaptive TSP problems
• Machine Learning: ECML 2004
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• Uniform tree approximation by global optimization techniques
• On the complexity of searching in trees and partially ordered structures

This page was built for publication: Approximating Optimal Binary Decision Trees

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