462 search results - page 8 / 93 » Learning DNF by Decision Trees |
ICML
2004
IEEE
15 years 10 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, ...
ECML
2007
Springer
15 years 4 months ago
2007
Springer
IJCSS
2000
14 years 9 months ago
2000
Abstract. The quality of a decision tree is usually evaluated through its complexity and its generalization accuracy. Tree-simpli
IJCNN
2007
IEEE
15 years 4 months ago
2007
IEEE
— Most research in machine learning focuses on scenarios in which a learner faces a single learning task, independently of other learning tasks or prior knowledge. In reality, ho...
ML
2008
ACM
14 years 9 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...