15 search results - page 1 / 3 » Anytime Induction of Decision Trees: An Iterative Improvemen... |
AAAI
2006
13 years 6 months ago
2006
Most existing decision tree inducers are very fast due to their greedy approach. In many real-life applications, however, we are willing to allocate more time to get better decisi...
ICML
2004
IEEE
14 years 5 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, ...
BICOB
2010
Springer
13 years 3 months ago
2010
Springer
A decision tree induction method for multilabel classification tasks (IS-MLT) is presented which uses an iterative approach for determining the best split at each node. The propo...
AAAI
2006
13 years 6 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, ...
AAAI
2004
13 years 6 months ago
2004
Performance profile trees have recently been proposed as a theoretical basis for fully normative deliberation control. In this paper we conduct the first experimental study of the...