Lower bounds on learning decision lists and trees
Information and Computation
ACM Computing Surveys (CSUR)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On an Optimal Split Tree Problem
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
On growing better decision trees from data
On growing better decision trees from data
Searching in random partially ordered sets
Theoretical Computer Science - Latin American theorotical informatics
Approximating Min Sum Set Cover
Algorithmica
Learnability and Automatizability
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
On the hardness of the minimum height decision tree problem
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
Decision trees for entity identification: approximation algorithms and hardness results
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Improving access to organized information
Improving access to organized information
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Approximating Decision Trees with Multiway Branches
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
On the complexity of searching in trees: average-case minimization
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On the Huffman and alphabetic tree problem with general cost functions
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Decision trees for entity identification: Approximation algorithms and hardness results
ACM Transactions on Algorithms (TALG)
On the complexity of searching in trees and partially ordered structures
Theoretical Computer Science
Approximation algorithms for stochastic orienteering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
We give a (ln n+ 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of mbinary tests T= (T1, ..., Tm) and a set of nitems X= (X1, ..., Xn). The goal is to output a binary tree where each internal node is a test, each leaf is an item and the total external path length of the tree is minimized. Total external path length is the sum of the depths of all the leaves in the tree. DT has a long history in computer science with applications ranging from medical diagnosis to experiment design. It also generalizes the problem of finding optimal average-case search strategies in partially ordered sets which includes several alphabetic tree problems. Our work decreases the previous upper bound on the approximation ratio by a constant factor. We provide a new analysis of the greedy algorithm that uses a simple accounting scheme to spread the cost of a tree among pairs of items split at a particular node. We conclude by showing that our upper bound also holds for the DT problem with weighted tests.