121 search results - page 3 / 25 » Algorithms for optimal dyadic decision trees |
JMLR
2002
13 years 6 months ago
2002
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
ICPR
2008
IEEE
14 years 1 months ago
2008
IEEE
We present an online adaptive clustering algorithm in a decision tree framework which has an adaptive tree and a code formation layer. The code formation layer stores the represen...
SIGIR
2011
ACM
12 years 10 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...
APPROX
2008
Springer
13 years 9 months 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, . ....
AAAI
2006
13 years 8 months ago
2006
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...