121 search results - page 3 / 25 » Algorithms for optimal dyadic decision trees |
133
Voted
JMLR
2002
15 years 3 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...
124
Voted
ICPR
2008
IEEE
15 years 10 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...
181
Voted
SIGIR
2011
ACM
14 years 6 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...
171
click to vote
APPROX
2008
Springer
15 years 5 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, . ....
114
Voted
AAAI
2006
15 years 4 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, ...