Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Using Imaginary Ensembles to Select GP Classifiers
Högskolan i Borås, Institutionen Handels- och IT-högskolan.ORCID iD: 0000-0003-0412-6199
Högskolan i Borås, Institutionen Handels- och IT-högskolan.
Högskolan i Borås, Institutionen Handels- och IT-högskolan.ORCID iD: 0000-0003-0274-9026
2010 (English)In: Genetic Programming: 13th European Conference, EuroGP 2010, Istanbul, Turkey, April 7-9, 2010, Proceedings / [ed] A.I. et al. Esparcia-Alcazar, Springer, 2010, p. 278-288Conference paper, Published paper (Refereed)
Abstract [en]

When predictive modeling requires comprehensible models, most data miners will use specialized techniques producing rule sets or decision trees. This study, however, shows that genetically evolved decision trees may very well outperform the more specialized techniques. The proposed approach evolves a number of decision trees and then uses one of several suggested selection strategies to pick one specific tree from that pool. The inherent inconsistency of evolution makes it possible to evolve each tree using all data, and still obtain somewhat different models. The main idea is to use these quite accurate and slightly diverse trees to form an imaginary ensemble, which is then used as a guide when selecting one specific tree. Simply put, the tree classifying the largest number of instances identically to the ensemble is chosen. In the experimentation, using 25 UCI data sets, two selection strategies obtained significantly higher accuracy than the standard rule inducer J48.

Place, publisher, year, edition, pages
Springer, 2010. p. 278-288
Series
LNCS ; 6021
Keywords [en]
classification, decision trees, ensembles, genetic programming, Machine learning
National Category
Computer Sciences Information Systems
Identifiers
URN: urn:nbn:se:hj:diva-45805Local ID: 0;0;miljJAILISBN: 978-3-642-12147-0 (print)OAI: oai:DiVA.org:hj-45805DiVA, id: diva2:1348940
Conference
13th European Conference, EuroGP 2010, Istanbul, Turkey, April 7-9, 2010
Note

Sponsorship:

This work was supported by the INFUSIS project (www.his.se/infusis) at the University of Skövde, Sweden, in partnership with the Swedish Knowledge Foundation under grant 2008/0502.

Available from: 2019-09-06 Created: 2019-09-06 Last updated: 2019-09-06Bibliographically approved

Open Access in DiVA

fulltext(199 kB)34 downloads
File information
File name FULLTEXT01.pdfFile size 199 kBChecksum SHA-512
0edbe5f1aa02e47606a24eb788977c5487faee514caf2e133d61c87e11619aea1e750280f6fa9e211f35956cb8e1cfaefee406963360606fcc32ccb66d36e7a8
Type fulltextMimetype application/pdf

Authority records BETA

Johansson, UlfKönig, RikardLöfström, Tuve

Search in DiVA

By author/editor
Johansson, UlfKönig, RikardLöfström, Tuve
Computer SciencesInformation Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 34 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 76 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf