Abstract
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.
Original language | English (US) |
---|---|
Title of host publication | Scalable Uncertainty Management - 10th International Conference, SUM 2016, Proceedings |
Editors | Steven Schockaert, Pierre Senellart |
Publisher | Springer Verlag |
Pages | 199-213 |
Number of pages | 15 |
ISBN (Print) | 9783319458557 |
DOIs | |
State | Published - 2016 |
Externally published | Yes |
Event | 10th International Conference on Scalable Uncertainty Management, SUM 2016 - Nice, France Duration: Sep 21 2016 → Sep 23 2016 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 9858 LNAI |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 10th International Conference on Scalable Uncertainty Management, SUM 2016 |
---|---|
Country/Territory | France |
City | Nice |
Period | 9/21/16 → 9/23/16 |
Funding
Parts of this work were supported by ONR grant N000141612739 and ARO grant W911NF1610342.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science