Abstract:
This paper presents a survey of evolutionary algorithms that are designed for decision-tree induction. In this context, most of the paper focuses on approaches that evolve decision trees as an alternate heuristics to the traditional top-down divide-and-conquer approach. Additionally, we present some alternative methods that make use of evolutionary algorithms to improve particular components of decision-tree classifiers. The paper's original contributions are the following. First, it provides an up-to-date overview that is fully focused on evolutionary algorithms and decision trees and does not concentrate on any specific evolutionary approach. Second, it provides a taxonomy, which addresses works that evolve decision trees and works that design decision-tree components by the use of evolutionary algorithms. Finally, a number of references are provided that describe applications of evolutionary algorithms for decision-tree induction in different domains. At the end of this paper, we address some important issues and open questions that can be the subject of future research.
Page(s): 291 - 312
Date of Publication: 23 June 2011
ISSN Information:
INSPEC Accession Number: 12673639
Publisher: IEEE

I. Introduction

A DECISION tree is a classifier that is depicted in a flowchart-like tree structure, which has been widely used to represent classification models, due to its comprehensible nature that resembles the human reasoning. Decision-tree induction algorithms present several advantages over other learning algorithms, such as robustness to noise, low computational cost for the generation of the model, and ability to deal with redundant attributes. Besides, the induced model usually presents a good generalization ability [1], [2].

References

References is not available for this document.