The DOI matches its Crossref record; 17 of the 19 references it cites were found in a registry or an index.
Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME
Open accessAbstract
We present a heuristic based algorithm to induce nonmonotonic logic programs that will explain the behavior of XGBoost trained classifiers. We use the technique based on the LIME approach to locally select the most important features contributing to the classification decision. Then, in order to explain the model’s global behavior, we propose the LIME-FOLD algorithm —a heuristic-based inductive logic programming (ILP) algorithm capable of learning nonmonotonic logic programs—that we apply to a transformed dataset produced by LIME. Our proposed approach is agnostic to the choice of the ILP algorithm. Our experiments with UCI standard benchmarks suggest a significant improvement in terms of classification evaluation metrics. Meanwhile, the number of induced rules dramatically decreases compared to ALEPH, a state-of-the-art ILP system.
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.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Examples include: the number of features in an explanation (e.g., [54,109,192,204,223,265]), average path length in a decision tree (e.g., [135,276,277]), reduction w.r.t.complete data sample (e.g., [7,33,109]), or the number of decision rules in a set (e.g., [137,144,203,223,266,302]).”
From From Anecdotal Evidence to Quantitative Evaluation Methods: A Systematic Review on Evaluating Explainable AI (2023) · cites this paper as [223]
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
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939785 · Cited by 54,569
"Why Should I Trust You?": Explaining the Predictions of Any Classifier
Ribeiro, M. T., Singh, S., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939778 · Cited by 17,555
XGBoost: A Scalable Tree Boosting System
Chen, T., & Guestrin, C. (2016) · arXiv · doi:10.48550/arxiv.1603.02754 · Cited by 7,104
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
Fayyad, U. M., & Irani, K. B. (1993) · International Joint Conference on Artificial Intelligence · Cited by 2,870
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Knowledge Representation, Reasoning and Declarative Problem Solving
Baral, C. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511543357 · Cited by 1,413
Predictive learning via rule ensembles
Friedman, J. H., & Popescu, B. E. (2008) · The Annals of Applied Statistics · doi:10.1214/07-aoas148 · Cited by 1,315
Muggleton, S. (1991) · New Generation Computing · doi:10.1007/bf03037089 · Cited by 1,044
Extracting Tree-Structured Representations of Trained Networks
Craven, M. W., & SHAVLIK, J. W. (1995) · neural information processing systems · Cited by 602
Explainable Artificial Intelligence (XAI)
Mohaghegh, S. D. (2024) · Artificial Intelligence for Science and Engineering Applications · doi:10.1201/9781003369356-8 · Cited by 215
Research works printed but not linked: 5
- Craven, M. W., and Shavlik, J. W. 1995. Extracting treestructured representations of trained networks. In Proceedings of the 8th International Conference on Neural Information Processing Systems , NIPS'95, 24-30. Cambridge, MA, USA: MIT Press.
- Landwehr, N.; Kersting, K.; and Raedt, L. D. 2005. nfoil: Integrating na¨ ıve bayes and FOIL. In Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA , 795-800.
- Muggleton, S.; Raedt, L.; Poole, D.; Bratko, I.; Flach, P.; Inoue, K.; and Srinivasan, A. 2012. Ilp turns 20. Mach. Learn. 86(1):3-23.
- Plotkin, G. D. 1971. A further note on inductive generalization, in machine intelligence, volume 6, pages 101-124.
- Zeng, Q.; Patel, J. M.; and Page, D. 2014. Quickfoil: Scalable inductive logic programming. Proc. VLDB Endow. 8(3):197-208.
Cited by
Nauta, M., Trienes, J., Pathak, S., Nguyen, E., Peters, M., Schmitt, Y., Schlötterer, J., van Keulen, M., & Seifert, C. (2023) · ACM Computing Surveys · doi:10.1145/3583558 · Cited by 590
Hamamoto, R., Suvarna, K., Yamada, M., Kobayashi, K., Shinkai, N., Miyake, M., Takahashi, M., Jinnai, S., Shimoyama, R., Sakai, A., et al. (2020) · Cancers · doi:10.3390/cancers12123532 · Cited by 207
Inductive Logic Programming via Differentiable Deep Neural Logic NetworksPreprint
Payani, A., & Fekri, F. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1906.03523 · Cited by 43
Justifications for Goal-Directed Constraint Answer Set Programming
Arias, J., Carro, M., Chen, Z., & Gupta, G. (2020) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.325.12 · Cited by 40
Self-citationCombinatorial Testing Metrics for Machine Learning
Lanus, E., Freeman, L., Kuhn, D. R., & Kacker, R. N. (2021) · IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW) · doi:10.1109/icstw52544.2021.00025 · Cited by 40
Metadata
- Authors
- Shakerin, F., & Gupta, G.
- Affiliations
- The University of Texas at Dallas (US)
- Venue
- Proceedings of the AAAI Conference on Artificial Intelligence
- Published
- 2019-07-17
- Volume
- 33
- Issue
- 01
- Pages
- 3052-3059
- ISSN
- 2159-5399 (ISSN-L)
- 2374-3468
- OpenAlex
- W2885489825
- Cited by
- 17
- References
- 19
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 2 · 2023: 3 · 2022: 2 · 2021: 2 · 2020: 4 · 2019: 2
- FWCI
- 0.96
- Type
- conference paper
- Language
- en
- Open access
- diamond
- doi.org
- Licence
- www.aaai.org/ (unspecified)
- Locations
- Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Science Foundation (1718945)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Explainable Artificial Intelligence (XAI)
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
- Physical Sciences › Computer Science › Information Systems › Data Mining Algorithms and Applications
- Keywords
- inductive logic programming, lime, XGBoost, explainable AI, model explanation, feature importance, heuristic search, boosting classifier, rule induction
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: Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME. https://app.cochat.ai/papers/10.1609/aaai.v33i01.33013052
- The paper
- Shakerin, F., & Gupta, G. (2019). Induction of Non-Monotonic Logic Programs to Explain Boosted Tree Models Using LIME. Proceedings of the AAAI Conference on Artificial Intelligence. https://doi.org/10.1609/aaai.v33i01.33013052
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.