Towards the automatic design of decision tree induction algorithms

  • Authors:
  • Rodrigo C. Barros;Márcio P. Basgalupp;André C.P.L.F. de Carvalho;Alex A. Freitas

  • Affiliations:
  • University of São Paulo, São Carlos, Brazil;Universidade Federal de São Paulo, São José dos Campos, Brazil;University of São Paulo, São Carlos, Brazil;University of Kent, Canterbury, United Kingdom

  • Venue:
  • Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Decision tree induction is one of the most employed methods to extract knowledge from data, since the representation of knowledge is very intuitive and easily understandable by humans. The most successful strategy for inducing decision trees, the greedy top-down approach, has been continuously improved by researchers over the years. This work, following recent breakthroughs in the automatic design of machine learning algorithms, proposes two different approaches for automatically generating generic decision tree induction algorithms. Both approaches are based on the evolutionary algorithms paradigm, which improves solutions based on metaphors of biological processes. We also propose guidelines to design interesting fitness functions for these evolutionary algorithms, which take into account the requirements and needs of the end-user.