his.sePublications
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
Genetic rule extraction optimizing brier score
School of Business and Informatics, University of Borås, Borås, Sweden.
School of Business and Informatics, University of Borås, Borås, Sweden.
University of Skövde, School of Humanities and Informatics. University of Skövde, The Informatics Research Centre.
2010 (English)In: Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10 / [ed] Pelikan, Martin & Branke, Jürgen, New York: Association for Computing Machinery (ACM), 2010, 1007-1014 p.Conference 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. Copyright 2010 ACM.

Place, publisher, year, edition, pages
New York: Association for Computing Machinery (ACM), 2010. 1007-1014 p.
Keyword [en]
Brier score, Genetic programming, Rule extraction, Complex model, Data sets, Extracting algorithm, Fitness functions, Key parts, Novel algorithm, Optimization function, Predictive modeling, Predictive performance, Probability estimate, Rule extraction algorithms, Algorithms, Function evaluation, Optimization, Trees (mathematics)
National Category
Computer and Information Science
Research subject
Technology
Identifiers
URN: urn:nbn:se:his:diva-7191DOI: 10.1145/1830483.1830668ScopusID: 2-s2.0-77955913724ISBN: 978-1-4503-0072-8 OAI: oai:DiVA.org:his-7191DiVA: diva2:604426
Conference
12th Annual Genetic and Evolutionary Computation Conference, GECCO-2010, 7 July 2010 through 11 July 2010, Portland, OR
Note

Sponsors: Assoc. Comput. Mach., Spec. Interest Group Genet.; Evol. Comput. (ACM SIGEVO)

Available from: 2013-02-11 Created: 2013-02-11 Last updated: 2013-09-06Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://dl.acm.org/citation.cfm?doid=1830483.1830668

Search in DiVA

By author/editor
Niklasson, Lars
By organisation
School of Humanities and InformaticsThe Informatics Research Centre
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 323 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