75 search results - page 2 / 15 » Approximating Optimal Binary Decision Trees |
RSCTC
2000
Springer
13 years 8 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
SIBGRAPI
2008
IEEE
13 years 11 months ago
2008
IEEE
This work proposes a simple approximation scheme for discrete data that leads to an infinitely smooth result without global optimization. It combines the flexibility of Binary Sp...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
The decision tree is one of the most fundamental ing abstractions. A commonly used type of decision tree is the alphabetic binary tree, which uses (without loss of generality) &quo...
KDD
2009
ACM
14 years 5 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
ICTAI
2003
IEEE
13 years 9 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...