Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • harvard-cite-them-right
  • 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
Genetic Rule Extraction Optimizing Brier Score
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: Genetic and Evolutionary Computation Conference, GECCO 2010, Proceedings of the 12th annual conference on Genetic and evolutionary computation / [ed] Martin Pelikan, Jürgen Branke, ACM , 2010, p. 1007-1014Conference paper, Published paper (Refereed)
Abstract [en]

Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent model, based on the opaque. Naturally, the extracted model should be as similar as possible to the opaque. This criterion, called fidelity, is therefore a key part of the optimization function in most rule extracting algorithms. To the best of our knowledge, all existing rule extraction algorithms targeting fidelity use 0/1 fidelity, i.e., maximize the number of identical classifications. In this paper, we suggest and evaluate a rule extraction algorithm utilizing a more informed fidelity criterion. More specifically, the novel algorithm, which is based on genetic programming, minimizes the difference in probability estimates between the extracted and the opaque models, by using the generalized Brier score as fitness function. Experimental results from 26 UCI data sets show that the suggested algorithm obtained considerably higher accuracy and significantly better AUC than both the exact same rule extraction algorithm maximizing 0/1 fidelity, and the standard tree inducer J48. Somewhat surprisingly, rule extraction using the more informed fidelity metric normally resulted in less complex models, making sure that the improved predictive performance was not achieved on the expense of comprehensibility.

Place, publisher, year, edition, pages
ACM , 2010. p. 1007-1014
Keywords [en]
rule extraction, brier score, genetic programming, Machine learning
National Category
Computer Sciences Information Systems
Identifiers
URN: urn:nbn:se:hb:diva-6402DOI: 10.1145/1830483.1830668Local ID: 2320/6795ISBN: 978-1-4503-0072-8 (print)OAI: oai:DiVA.org:hb-6402DiVA, id: diva2:887090
Conference
GECCO '10: Genetic and Evolutionary Computation Conference Portland Oregon USA July 7 - 11, 2010
Available from: 2015-12-22 Created: 2015-12-22 Last updated: 2022-09-28

Open Access in DiVA

fulltext(376 kB)641 downloads
File information
File name FULLTEXT01.pdfFile size 376 kBChecksum SHA-512
fffb51ca27a44dae5236d7a2b3f4656e61557bf43bfe04025a6a87b3f4721e3313374ae1424e547ec9c650b73df2346b9c3277318295abba51008564aacdd9d6
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Johansson, UlfKönig, Rikard

Search in DiVA

By author/editor
Johansson, UlfKönig, Rikard
By organisation
School of Business and IT
Computer SciencesInformation Systems

Search outside of DiVA

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

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • harvard-cite-them-right
  • 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