A Survey of Evolutionary Algorithms for Decision-Tree Induction

@article{Barros2012ASO,
  title={A Survey of Evolutionary Algorithms for Decision-Tree Induction},
  author={Rodrigo C. Barros and M{\'a}rcio P. Basgalupp and Andr{\'e} Carlos Ponce de Leon Ferreira de Carvalho and Alex Alves Freitas},
  journal={IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)},
  year={2012},
  volume={42},
  pages={291-312}
}
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… 

Figures and Tables from this paper

Growing a Forest: - Genetic Decision tree Induction

TLDR
EMTI, the Evolutionary Multi-class Tree Inductor, a genetic programming method for inducing parallel axis, poly-ary decision trees for multiclass classification problems, focuses on creating accurate decision trees with a high degree of human readability.

On the automatic design of decision-tree induction algorithms

TLDR
This thesis proposes to automatically generate decision-tree induction algorithms based on the evolutionary algorithms paradigm, which improves solutions based on metaphors of biological processes and shows that HEAD-DT is prone to a special case of overfitting when it is executed under the second scenario of the general framework.

Automatic Design of Decision-Tree Induction Algorithms

TLDR
This thesis proposes to automatically generate decision-tree induction algorithms based on the evolutionary algorithms paradigm, which improves solutions based on metaphors of biological processes and shows that HEAD-DT is prone to a special case of overfitting when it is executed under the second scenario of the general framework.

Using similarity-based selection in evolutionary design of decision trees

TLDR
A novel method of selection is proposed that takes into consideration the similarity of trees in the crossover process, to prevent inbreeding and maintain the diversity of the population over the course of evolution.

Evolutionary Design of Decision-Tree Algorithms Tailored to Microarray Gene Expression Data Sets

TLDR
A hyper-heuristic evolutionary algorithm called HEAD-DT is proposed that evolves design components of top-down decision-tree induction algorithms and is capable of generating algorithms that significantly outperform the baseline manually designed decision-Tree algorithms regarding predictive accuracy and F-measure.

Automatic Design of Decision-Tree Algorithms with Evolutionary Algorithms

TLDR
This study reports the empirical analysis of a hyper-heuristic evolutionary algorithm that is capable of automatically designing top-down decision-tree induction algorithms, HEAD-DT, which is extensively tested using 20 public UCI datasets and 10 microarray gene expression datasets.

On Improving the Prediction Accuracy of a Decision Tree Using Genetic Algorithm

TLDR
This paper proposes a new, easy-to-implement genetic algorithm-based decision tree induction technique which is more likely to ascertain conditional dependencies among the attributes.

A hyper-heuristic evolutionary algorithm for automatically designing decision-tree algorithms

TLDR
This work proposes a hyper-heuristic evolutionary algorithm for automatically generating decision-tree induction algorithms, named HEAD-DT, and shows that it can generate algorithms that significantly outperform C4.5 and CART regarding predictive accuracy and F-Measure.

Differential Evolution Algorithm in the Construction of Interpretable Classification Models

TLDR
Two methods are described in this chapter: one implementing a recursive partitioning strategy to find the most suitable oblique hyperplane of each internal node of a decision tree, and the other conducting a global search of a near-optimal oblique decision tree.
...

References

SHOWING 1-10 OF 154 REFERENCES

On the induction of decision trees for multiple concept learning

TLDR
This dissertation makes four contributions to the theory and practice of the top-down non-backtracking induction of decision trees for multiple concept learning, and analyzes the merits and limitations of using the entropy measure (and others from the family of impurity measures) for attribute selection.

Evolution of Decision Trees

TLDR
This work proposes to induce a decision trees (without regarding the type) with an unified algorithm based on artificial evolution, suggesting that Evolutionary Algorithms are competitive and robust for inducing all kinds of decision trees, achieving sometimes better performance than traditional algorithms.

Lexicographic multi-objective evolutionary induction of decision trees

TLDR
A new GA-based algorithm based on a lexicographic multi-objective approach for decision tree induction that is able to avoid the previously described problems, reporting accuracy gains and induced models with a significantly reduction in the complexity considering tree sizes.

A Genetic Algorithm-Based Approach for Building Accurate Decision Trees

TLDR
This paper takes trees generated by a commercial decision tree package, namely, C4.5, and allows them to crossover and mutate for a number of generations in order to yield trees of better quality, and finds that this approach produces uniformly high-quality decision trees.

Inducing oblique decision trees with evolutionary algorithms

TLDR
It is shown that the classification accuracy improves when the trees obtained with the EAs are combined in ensembles, and that sometimes it is possible to build the ensemble of evolutionary trees in less time than a single traditional oblique tree.

Evolutionary Induction of Cost-Sensitive Decision Trees

TLDR
The proposed method is experimentally validated and preliminary results show that the global approach is able to effectively induce cost-sensitive decision trees.

The Construction and Evaluation of Decision Trees: a Comparison of Evolutionary and Concept Learning Methods

The CALTROP program which is presented in this paper provides a test of the feasibility of representing a decision tree as a linear chromosome and applying a genetic algorithm to the optimisation of

Evolutionary decision forests – decision making with multiple evolutionary constructed decision trees

TLDR
A self-adapting evolutionary algorithm for the induction of decision trees and the principle of decision making based on multiple evolutionary induced decision trees is described, which is used as a fault predictive approach to foresee dangerous software modules, which can largely enhance the reliability of software.

Mixed Decision Trees: An Evolutionary Approach

TLDR
In the paper, a new evolutionary algorithm (EA) for mixed tree learning is proposed, which searches for an optimal tree in a global manner and learns a tree structure and tests in one run of the EA.
...