334 search results - page 8 / 67 » The Alternating Decision Tree Learning Algorithm |
65
Voted
ECML
2005
Springer
15 years 3 months ago
2005
Springer
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
ICTAI
1999
IEEE
15 years 1 months ago
1999
IEEE
This work deals with stability in incremental induction of decision trees. Stability problems arise when an induction algorithm must revise a decision tree very often and oscillat...
ICML
1998
IEEE
15 years 10 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...
85
Voted
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper extends previous work on skewing, an approach to problematic functions in decision tree induction. The previous algorithms were applicable only to functions of binary v...
65
Voted
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
We introduce a novel algorithm for decision tree learning in the multi-instance setting as originally defined by Dietterich et al. It differs from existing multi-instance tree lea...