219 search results - page 3 / 44 » Optimal dyadic decision trees |
ALDT
2009
Springer
14 years 5 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
SIGIR
2011
ACM
13 years 1 months ago
2011
ACM
While a user’s preference is directly reflected in the interactive choice process between her and the recommender, this wealth of information was not fully exploited for learni...
FCS
2006
13 years 11 months ago
2006
Probabilistic (or randomized) decision trees can be used to compute Boolean functions. We consider two types of probabilistic decision trees - one has a certain probability to give...
ML
2008
ACM
13 years 10 months ago
2008
ACM
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
APPROX
2008
Springer
14 years 11 days ago
2008
Springer
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....