Evolutionary model trees for handling continuous classes in machine learning
dc.contributor.author | Barros, Rodrigo C. | |
dc.contributor.author | Ruiz, Duncan D. | |
dc.contributor.author | Basgalupp, Marcio P. [UNIFESP] | |
dc.contributor.institution | Universidade de São Paulo (USP) | |
dc.contributor.institution | Pontificia Univ Catolica Rio Grande do Sul | |
dc.contributor.institution | Universidade Federal de São Paulo (UNIFESP) | |
dc.date.accessioned | 2016-01-24T14:06:16Z | |
dc.date.available | 2016-01-24T14:06:16Z | |
dc.date.issued | 2011-03-01 | |
dc.description.abstract | Model trees are a particular case of decision trees employed to solve regression problems. They have the advantage of presenting an interpretable output, helping the end-user to get more confidence in the prediction and providing the basis for the end-user to have new insight about the data, confirming or rejecting hypotheses previously formed. Moreover, model trees present an acceptable level of predictive performance in comparison to most techniques used for solving regression problems. Since generating the optimal model tree is an NP-Complete problem, traditional model tree induction algorithms make use of a greedy top-down divide-and-conquer strategy, which may not converge to the global optimal solution. in this paper, we propose a novel algorithm based on the use of the evolutionary algorithms paradigm as an alternate heuristic to generate model trees in order to improve the convergence to globally near-optimal solutions. We call our new approach evolutionary model tree induction (E-Motion). We test its predictive performance using public UCI data sets, and we compare the results to traditional greedy regression/model trees induction algorithms, as well as to other evolutionary approaches. Results show that our method presents a good trade-off between predictive performance and model comprehensibility, which may be crucial in many machine learning applications. (C) 2010 Elsevier Inc. All rights reserved. | en |
dc.description.affiliation | Univ São Paulo, BR-13560970 Sao Carlos, SP, Brazil | |
dc.description.affiliation | Pontificia Univ Catolica Rio Grande do Sul, BR-90619900 Porto Alegre, RS, Brazil | |
dc.description.affiliation | Universidade Federal de São Paulo, Inst Ciencia & Tecnol, BR-12231280 Sao Jose Dos Campos, Brazil | |
dc.description.affiliationUnifesp | Universidade Federal de São Paulo, Inst Ciencia & Tecnol, BR-12231280 Sao Jose Dos Campos, Brazil | |
dc.description.source | Web of Science | |
dc.description.sponsorship | Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP) | |
dc.description.sponsorship | European Research Consortium for Informatics and Mathematics (ERCIM) | |
dc.format.extent | 954-971 | |
dc.identifier | http://dx.doi.org/10.1016/j.ins.2010.11.010 | |
dc.identifier.citation | Information Sciences. New York: Elsevier B.V., v. 181, n. 5, p. 954-971, 2011. | |
dc.identifier.doi | 10.1016/j.ins.2010.11.010 | |
dc.identifier.issn | 0020-0255 | |
dc.identifier.uri | http://repositorio.unifesp.br/handle/11600/33527 | |
dc.identifier.wos | WOS:000286556700002 | |
dc.language.iso | eng | |
dc.publisher | Elsevier B.V. | |
dc.relation.ispartof | Information Sciences | |
dc.rights | info:eu-repo/semantics/restrictedAccess | |
dc.rights.license | http://www.elsevier.com/about/open-access/open-access-policies/article-posting-policy | |
dc.subject | Evolutionary algorithms | en |
dc.subject | Genetic programming | en |
dc.subject | Model trees | en |
dc.subject | Continuous classes | en |
dc.subject | Machine learning | en |
dc.title | Evolutionary model trees for handling continuous classes in machine learning | en |
dc.type | info:eu-repo/semantics/article |