41 search results - page 2 / 9 » Optimizing the Induction of Alternating Decision Trees |
CP
2009
Springer
14 years 5 months ago
2009
Springer
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
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, ...
JMLR
2002
13 years 4 months ago
2002
Cross-validation is a useful and generally applicable technique often employed in machine learning, including decision tree induction. An important disadvantage of straightforward...
ICANNGA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. In the paper, a new method of decision tree learning for costsensitive classification is presented. In contrast to the traditional greedy top-down inducer in the proposed...
SAC
2006
ACM
13 years 10 months ago
2006
ACM
We propose a method for induction of compact optimal recommendation policies based on discovery of frequent itemsets in a purchase database, followed by the application of standar...