259 search results - page 6 / 52 » Advances in decision tree construction |
AIMSA
2000
Springer
14 years 4 days ago
2000
Springer
Abstract. Decision trees are considered as an efficient technique to express classification knowledge and to use it. However, their most standard algorithms do not deal with uncert...
ACL
1996
13 years 9 months ago
1996
We report on a method for compiling decision trees into weighted finite-state transducers. The key assumptions are that the tree predictions specify how to rewrite symbols from an...
ML
2008
ACM
13 years 8 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...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
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, ...
AAAI
2006
13 years 10 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, ...