583 search results - page 11 / 117 » Efficient algorithms for constructing decision trees with co... |
158
click to vote
IJCAI
2003
15 years 7 months ago
2003
This paper presents a novel, promising approach that allows greedy decision tree induction algorithms to handle problematic functions such as parity functions. Lookahead is the st...
156
click to vote
ACL
1996
15 years 7 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...
138
click to vote
AAAI
2006
15 years 7 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, ...
175
click to vote
BIRTHDAY
2008
Springer
15 years 7 months ago
2008
Springer
The paper is an overview of a recently developed compilation data structure for graphical models, with specific application to constraint networks. The AND/OR Multi-Valued Decision...
169
click to vote
IRI
2008
IEEE
16 years 7 days ago
2008
IEEE
Recovering design patterns applied in a system can help refactoring the system. Machine learning algorithms have been successfully applied in mining data patterns. However, one of...