55 search results - page 4 / 11 » A new metric splitting criterion for decision trees |
CAIP
2009
Springer
13 years 11 months ago
2009
Springer
Binary decision trees based on univariate splits have traditionally employed so-called impurity functions as a means of searching for the best node splits. Such functions use estim...
DAWAK
2006
Springer
13 years 11 months ago
2006
Springer
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed. In non-terminal nodes of a mixed decision tree different types of tests can be placed, ranging ...
ICAISC
2004
Springer
14 years 1 months ago
2004
Springer
In the paper, a new evolutionary approach to induction of oblique decision trees is described. In each non-terminal node, the specialized evolutionary algorithm is applied to searc...
IJCAI
1993
13 years 9 months ago
1993
This article describes a new system for induction of oblique decision trees. This system, OC1, combines deterministic hill-climbing with two forms of randomization to nd a good ob...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract--Recently, the following discrimination aware classification problem was introduced: given a labeled dataset and an attribute , find a classifier with high predictive accu...