Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Evaluating Algorithms for Concept Description
University of Borås, School of Business and IT. (CSL@BS)
University of Borås, School of Business and IT. (CSL@BS)
University of Borås, School of Business and IT. (CSL@BS)
2009 (English)Conference paper, Published paper (Refereed)
Abstract [en]

When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most important relationships in the data in an accurate and understandable way. Two natural representations for this are decision trees and decision lists. In this study, the two decision list algorithms RIPPER and Chipper, and the decision tree algorithm C4.5, are evaluated for concept description, using publicly available datasets. The experiments show that C4.5 performs very well regarding accuracy and brevity, i.e. the ability to classify instances with few tests, but also produces large models that are hard to survey and contain many extremely specific rules, thus not being good concept descriptions. The decision list algorithms perform reasonably well on accuracy, and are mostly able to produce small models with relatively good predictive performance. Regarding brevity, Chipper is better than RIPPER, using on average fewer conditions to classify an instance. RIPPER, on the other hand, excels in relevance, i.e. the ability to capture a large number of instances with every rule.

Place, publisher, year, edition, pages
CSREA , 2009.
Keyword [en]
concept description, rule induction, decision lists, Machine Learning
Keyword [sv]
data mining
National Category
Computer Science Computer and Information Science
Identifiers
URN: urn:nbn:se:hb:diva-6310Local ID: 2320/5910ISBN: 1-60130-099-X (print)OAI: oai:DiVA.org:hb-6310DiVA: diva2:886997
Conference
5th International Conference on Data Mining - DMIN 09, Las Vegas, USA
Available from: 2015-12-22 Created: 2015-12-22 Last updated: 2017-05-02

Open Access in DiVA

fulltext(215 kB)210 downloads
File information
File name FULLTEXT01.pdfFile size 215 kBChecksum SHA-512
7b31f477db4fd8f4fb73429bc334daab9426e9f3f5d07d28fd813bc35aff6cd3fdf253ce807734a676b5762da1ffc1c18146844e4e9a72e23aa7c16eafb83ef4
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Sönströd, CeciliaJohansson, UlfLöfström, Tuve
By organisation
School of Business and IT
Computer ScienceComputer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 210 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: 79 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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