Metric Logic Program Explanations for Complex Separator Functions
There are many classifiers that treat entities to be classified as points in a high-dimensional vector space and then compute a separator S between entities in class \(+1\) from those in class \(-1\). However, such classifiers are usually very hard to explain in plain English to domain experts. We propose Metric Logic Programs (MLPs) which are a fragment of constraint logic programs as a new paradigm for explaining S. We present multiple measures of quality of an MLP and define the problem of finding an MLP-Explanation of S and show that it - and various related problems - are NP-hard. We present the MLP_Extract algorithm to extract MLP explanations for S. We show that while our algorithms provide more succinct, simpler, and higher fidelity explanations than association rules that are less expressive, our algorithms do require additional run-time.
- 1.Online appendix (2016). https://sites.google.com/site/mlpextraction/
- 6.Cohen, W.W.: Fast effective rule induction. In: ICML, pp. 115–123 (1995)Google Scholar
- 7.Craven, M.W., Shavlik, J.W.: Extracting tree-structured representations of trained networks. Adv. Neural Inf. Process. Syst. 8, 24–30 (1996)Google Scholar
- 11.Jaffar, J., Lassez, J.-L.: Constraint logic programming. In: POPL, pp. 111–119 (1987)Google Scholar
- 15.Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., Los Altos (1993)Google Scholar
- 16.Reiter, R.: On closed world data bases. In: Ginsberg, M.L. (ed.) Readings in Nonmonotonic Reasoning, pp. 300–310. Kaufmann, Los Altos (1987)Google Scholar