Induction of non-monotonic logic programs to explain boosted tree models using lime

12Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Shakerin, F., & Gupta, G. (2019). Induction of non-monotonic logic programs to explain boosted tree models using lime. In 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019 (pp. 3052–3059). AAAI Press. https://doi.org/10.1609/aaai.v33i01.33013052

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free