Decision Tree Induction using Adaptive FSA

Authors

  • Hemerson Pistori Universidade Catolica Dom Bosco, Depto. Engenharia de Computacao
  • Joao Jose Neto Universidade de Sao Paulo, Escola Politecnica

DOI:

https://doi.org/10.19153/cleiej.6.1.4

Keywords:

Machine Learning, Decision Tree Induction, Adaptive Automata

Abstract

This paper introduces a new algorithm for the induction of decision trees, based on adaptive techniques. One of the main feature of this algorithm is the application of automata theory to formalize the problem of decision tree induction and the use of a hybrid approach, which integrates both syntactical and statistical strategies. Some experimental results are also pre- sented indicating that the adaptive approach is useful in the construction of efficient learning algorithms.

Downloads

Published

2018-09-12

Issue

Vol. 6 No. 1 (2003): Special Issue of Best Papers presented at CLEI'2002. Montevideo, Uruguay. Guest Editor: Alfredo Viola.

Section

Articles

License

CLEIej is supported by its home institution, CLEI, and by the contribution of the Latin American and international researchers community, and it does not apply any author charges whatsoever for submitting and publishing. Since its creation in 1998, all contents are made publicly accesibly. The current license being applied is a (CC)-BY license (effective October 2015; between 2011 and 2015 a (CC)-BY-NC license was used).