55 search results - page 3 / 11 » A new metric splitting criterion for decision trees |
ECML
2007
Springer
14 years 1 months ago
2007
Springer
Decision tree learning algorithms produce accurate models that can be interpreted by domain experts. However, these algorithms are known to be unstable – they can produce drastic...
ICDE
2000
IEEE
14 years 9 months ago
2000
IEEE
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
EDBT
2000
ACM
13 years 11 months ago
2000
ACM
In this paper we present the Slim-tree, a dynamic tree for organizing metric datasets in pages of fixed size. The Slim-tree uses the "fat-factor" which provides a simple ...
IJCAI
1997
13 years 9 months ago
1997
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
IJCAI
1989
13 years 8 months ago
1989
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...