Evolving groups of basic decision trees
Matej Šprogar, Peter Kokol, Milan Zorman, Vili Podgorelec, Lenka Lhotská, Jǐŕı Kléma · 2002
A decision tree is a good classifier with a transparent decision mechanism. Decision-tree building methods usually have problems in splitting the learning samples into more subsets, because of the nature of the tree. If the classification into such subsets is not possible, it is better to put the classification decision on to some other classifier. This leads to the introduction of a null classification, which simply means that no classification is possible in this step. This approach is sensible with evolutionary methods, as they can handle a number of trees simultaneously. In the process of construction, we have to address the problem of whether a classification is sensible. The performance of the proposed model has been tested on several data sets and the results presented on one such data set show its potential.