The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Extracting rules from trained neural networks
Abstract
This paper presents an algorithm for extracting rules from trained neural networks. The algorithm is a decompositional approach which can be applied to any neural network whose output function is monotone such as sigmoid function. Therefore, the algorithm can be applied to multilayer neural networks, recurrent neural networks and so on. It does not depend on training algorithms, and its computational complexity is polynomial. The basic idea is that the units of neural networks are approximated by Boolean functions. But the computational complexity of the approximation is exponential, and so a polynomial algorithm is presented. The author has applied the algorithm to several problems to extract understandable and accurate rules. This paper shows the results for the votes data, mushroom data, and others. The algorithm is extended to the continuous domain, where extracted rules are continuous Boolean functions. Roughly speaking, the representation by continuous Boolean functions means the representation using conjunction, disjunction, direct proportion, and reverse proportion. This paper shows the results for iris data.
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
Research works printed but not linked: 19
- 10.1016/0893-6080(95)00086-0 · DOI · Paper page
- quinlan, 1993, C4 5 Programs for Machine Learning
- 10.1007/BF00993982 · doi:10.1007/bf00993982
- thurn, 1993, Extracting provably correct rules from artificial neural networks
- 10.1007/BF00993103 · DOI · Paper page
- tsukimoto, 1994, the discovery of propositions in noisy data, Machine Intelligence 13, 143, 10.1093/oso/9780198538509.003.0006 · doi:10.1093/oso/9780198538509.003.0006
- tsukimoto, 1994, the discovery of logical propositions in numerical data, AAAI 94 Wkshp Knowledge Discovery in Databases, 205
- tsukimoto, 1994, on continuously valued logical functions satisfying all axioms of classical logic, Syst Comput Japan, 25, 33
- tsukimoto, 1995, efficient algorithms for inductive learning—an application of multilinear functions to inductive learning, Machine Intelligence 14, 427
- tsukimoto, 1996, an algorithm for extracting propositions from trained neural networks using multilinear functions, Rules Networks Proc Rule Extraction Trained Artificial Neural Networks Wkshp AISB 96, 103
- 10.1016/B978-1-55860-307-3.50016-2 · DOI
- andrews, 1996, Rules and Networks Proc Rule Extraction Trained Artificial Neural Networks Wkshp AISB 96
- 10.1109/21.299696 · DOI · Paper page
- 10.1016/B978-1-55860-335-6.50013-1 · DOI · Paper page
- 10.1109/72.159060 · DOI
- 10.1016/0893-6080(96)83696-3 · DOI · Paper page
- andrews, 1994, rule extraction from a constrained error back propagation mlp, Proc 5th Australian Conf Neural Networks, 9
- 10.1145/174130.174138 · DOI · Paper page
- tsukimoto, 1997, extracting propositions from trained neural networks, Proc IJCAI-97, 1098
Cited by
Arrieta, A. B., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., García, S., Gil-López, S., Molina, D., Benjamins, R., et al. (2019) · arXiv · doi:10.48550/arxiv.1910.10045 · Cited by 11,321
Barredo Arrieta, A., Díaz-Rodríguez, N., Del Ser, J., Bennetot, A., Tabik, S., Barbado, A., Garcia, S., Gil-Lopez, S., Molina, D., Benjamins, R., et al. (2020) · Information Fusion · doi:10.1016/j.inffus.2019.12.012 · Cited by 10,423
“Multi-Layer Neural Networks Explanation by simplification Rule-based learner: [82, 83, 147, 148, 246, 247, 248, 249, 250, 251]”
Explaining Explanations: An Overview of Interpretability of Machine Learning
Gilpin, L. H., Bau, D., Yuan, B. Z., Bajwa, A., Specter, M., & Kagal, L. (2018) · 2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA) · doi:10.1109/dsaa.2018.00018 · Cited by 2,507
Ali, S., Abuhmed, T., El-Sappagh, S., Muhammad, K., Alonso-Moral, J. M., Confalonieri, R., Guidotti, R., Del Ser, J., Díaz-Rodríguez, N., & Herrera, F. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.101805 · Cited by 1,762
Explainable Artificial Intelligence for Tabular Data: A Survey
Sahakyan, M., Aung, Z., & Rahwan, T. (2021) · IEEE Access · doi:10.1109/access.2021.3116481 · Cited by 135
(2018) · arXiv (Cornell University) · Cited by 113
Survey on Explainable AI: Techniques, challenges and open issues
Abusitta, A., Li, M. Q., & Fung, B. C. M. (2024) · Expert Systems with Applications · doi:10.1016/j.eswa.2024.124710 · Cited by 98
Explainable machine learning for public policy: Use cases, gaps, and research directions
Amarasinghe, K., Rodolfa, K. T., Lamba, H., & Ghani, R. (2023) · Data & Policy · doi:10.1017/dap.2023.2 · Cited by 73
Metadata
- Authors
- Tsukimoto, H.
- Venue
- IEEE Transactions on Neural Networks
- Published
- 2000-03
- Volume
- 11
- Issue
- 2
- Pages
- 377-389
- ISSN
- 1045-9227 (ISSN-L)
- OpenAlex
- W2145470394
- Cited by
- 166
- References
- 1
- FWCI
- 9.58
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.