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
Finding the Tree in the Forest
University of Borås, School of Business and IT. (CSL@BS)
University of Borås, School of Business and IT. (CSL@BS)
2010 (English)In: Proceeding of IADIS International Conference Applied Computing 2010 / [ed] Hans Weghorn, Pedro Isaías, Radu Vasio, IADIS Press , 2010, p. 135-142Conference paper, Published paper (Refereed)
Abstract [en]

Decision trees are often used for decision support since they are fast to train, easy to understand and deterministic; i.e., always create identical trees from the same training data. This property is, however, only inherent in the actual decision tree algorithm, nondeterministic techniques such as genetic programming could very well produce different trees with similar accuracy and complexity for each execution. Clearly, if more than one solution exists, it would be misleading to present a single tree to a decision maker. On the other hand, too many alternatives could not be handled manually, and would only lead to confusion. Hence, we argue for a method aimed at generating a suitable number of alternative decision trees with comparable accuracy and complexity. When too many alternative trees exist, they are grouped and representative accurate solutions are selected from each group. Using domain knowledge, a decision maker could then select a single best tree and, if required, be presented with a small set of similar solutions, in order to further improve his decisions. In this paper, a method for generating alternative decision trees is suggested and evaluated. All in all,four different techniques for selecting accurate representative trees from groups of similar solutions are presented. Experiments on 19 UCI data sets show that it often exist dozens of alternative trees, and that one of the evaluated techniques clearly outperforms all others for selecting accurate and representative models.

Place, publisher, year, edition, pages
IADIS Press , 2010. p. 135-142
Keywords [en]
decision support, decision trees, genetic programming, alternative solutions, inconsistency
Keywords [sv]
Data Mining
National Category
Computer Sciences Computer and Information Sciences
Identifiers
URN: urn:nbn:se:hb:diva-6416Local ID: 2320/6870ISBN: 978-972-8939-30-4 (print)OAI: oai:DiVA.org:hb-6416DiVA, id: diva2:887104
Available from: 2015-12-22 Created: 2015-12-22 Last updated: 2018-01-10

Open Access in DiVA

fulltext(584 kB)138 downloads
File information
File name FULLTEXT01.pdfFile size 584 kBChecksum SHA-512
97a6a4a74bfc1f697f13b7af45ffb783ff532e244f4930be63b577b08bd920dc9cc60da1b9ba8f57b89f3ea4715819f2454c354a6f329bf645018eb30fc9c4c1
Type fulltextMimetype application/pdf

Authority records BETA

König, RikardJohansson, Ulf

Search in DiVA

By author/editor
König, RikardJohansson, Ulf
By organisation
School of Business and IT
Computer SciencesComputer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 138 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: 112 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