Using Rule Extraction to Improve the Comprehensibility of Predictive Models
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Whereas newer machine learning techniques, like artificial neural networks and support vector machines, have shown superior performance in various benchmarking studies, the application of these techniques remains largely restricted to research environments. A more widespread adoption of these techniques is foiled by their lack of explanation capability which is required in some application areas, like medical diagnosis or credit scoring. To overcome this restriction, various algorithms have been proposed to extract a meaningful description of the underlying 'blackbox' models. These algorithms' dual goal is to mimic the behavior of the black box as closely as possible while at the same time they have to ensure that the extracted description is maximally comprehensible. In this research report, we first develop a formal definition of 'rule extraction' and comment on the inherent trade-off between accuracy and comprehensibility. Afterwards, we develop a taxonomy by which rule extraction algorithms can be classified and discuss some criteria by which these algorithms can be evaluated. Finally, an in-depth review of the most important algorithms is given. This report is concluded by pointing out some general shortcomings of existing techniques and opportunities for future research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Survey and critique of techniques for extracting rules from trained artificial neural networks
Andrews, R., Diederich, J., & Tickle, A. B. (1995) · Knowledge-Based Systems · doi:10.1016/0950-7051(96)81920-4 · Cited by 1,225
Benchmarking state-of-the-art classification algorithms for credit scoring
Baesens, B., Van Gestel, T., Viaene, S., Stepanova, M., Suykens, J., & Vanthienen, J. (2003) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601545 · Cited by 904 · cited 1×
“Finally, several benchmarking studies [5] [54] [57] have shown that in many application areas opaque models achieve better performance than 'white box' models.”
Self-citationOn the Quasi-Minimal Solution of the General Covering Problem
Michalski, R. S. (1969) · George Mason University · doi:10.13021/mars/3596 · Cited by 232
Cited by
Interpretation of Quantitative Structure-Activity Relationship Models: Past, Present, and Future
Polishchuk, P. (2017) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.7b00274 · Cited by 236
Bell, A., Solano-Kamaiko, I., Nov, O., & Stoyanovich, J. (2022) · 2022 ACM Conference on Fairness Accountability and Transparency · doi:10.1145/3531146.3533090 · Cited by 103
Bell, A., Nov, O., & Stoyanovich, J. (2023) · Data & Policy · doi:10.1017/dap.2023.8 · Cited by 44
Metadata
- Authors
- Huysmans, J., Baesens, B., & Vanthienen, J.
- Venue
- SSRN Electronic Journal
- Publisher
- Elsevier BV
- Published
- 2006
- ISSN
- 1556-5068 (ISSN-L)
- OpenAlex
- W1511097925
- Cited by
- 94
- References
- 3
- Type
- posted content
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Using Rule Extraction to Improve the Comprehensibility of Predictive Models. https://app.cochat.ai/papers/10.2139/ssrn.961358
- The paper
- Huysmans, J., Baesens, B., & Vanthienen, J. (2006). Using Rule Extraction to Improve the Comprehensibility of Predictive Models. SSRN Electronic Journal. https://doi.org/10.2139/ssrn.961358
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.