12 search results - page 1 / 3 » Partitioning Nominal Attributes in Decision Trees |
DATAMINE
1999
13 years 4 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...
ICML
2005
IEEE
14 years 5 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...
RSCTC
2000
Springer
13 years 8 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...
MLDM
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. In supervised learning, discretization of the continuous explanatory attributes enhances the accuracy of decision tree induction algorithms and naive Bayes classifier. M...
SDM
2008
SIAM
13 years 6 months ago
2008
SIAM
Decision trees are among the most popular pattern types in data mining due to their intuitive representation. However, little attention has been given on the definition of measure...