205 search results - page 1 / 41 » Decision trees do not generalize to new variations |
CI
2010
13 years 2 months ago
2010
FLAIRS
2006
13 years 6 months ago
2006
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...
DATAMINE
1999
13 years 5 months ago
1999
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We give an algorithm that learns any monotone Boolean function f : {-1, 1}n {-1, 1} to any constant accuracy, under the uniform distribution, in time polynomial in n and in the de...
ICML
1998
IEEE
14 years 6 months ago
1998
IEEE
In this work, we present a new bottom-up algorithmfor decision tree pruning that is very e cient requiring only a single pass through the given tree, and prove a strong performanc...