Bayesian Rule Sets for Interpretable Classification
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
A Rule Set model consists of a small number of short rules for interpretable classification, where an instance is classified as positive if it satisfies at least one of the rules. The rule set provides reasons for predictions, and also descriptions of a particular class. We present a Bayesian framework for learning Rule Set models, with prior parameters that the user can set to encourage the model to have a desired size and shape in order to conform with a domain-specific definition of interpretability. We use an efficient inference approach for searching for the MAP solution and provide theoretical bounds to reduce computation. We apply Rule Set models to ten UCI data sets and compare the performance with other interpretable and non-interpretable models.
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
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
CPAR: Classification based on Predictive Association Rules
Yin, X., & Han, J. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.40 · Cited by 833
Letham, B., Rudin, C., McCormick, T. H., & Madigan, D. (2015) · The Annals of Applied Statistics · doi:10.1214/15-aoas848 · Cited by 766 · cited 1×
“Our simulated annealing steps are similar to the Gibbs sampling steps used by [20], [21] for rule-list models, with two changes: (i) exploration is only over rules that affect misclassified points (curiosity), (ii) we have bounds to reduce the search space (the same effect as cutting planes).”
MethodSelf-citation
Research works printed but not linked: 21
- 10.1016/B978-1-55860-377-6.50023-2 · DOI · Paper page
- malioutov, 2013, Exact rule learning via boolean compressed sensing, ICML
- 10.1097/00003246-198811000-00006 · DOI · Paper page
- 10.1023/A:1008894516817 · DOI · Paper page
- 10.1007/BF00962234 · DOI · Paper page
- 10.1109/69.842268 · DOI · Paper page
- 10.1007/BF02283750 · DOI · Paper page
- 10.1509/jmkr.47.3.485 · DOI · Paper page
- 10.1145/2623330.2623648 · DOI · Paper page
- wang, 2016, Supplementary material for Bayesian Rule Sets for Interpretable Classification
- 10.1145/1132516.1132569 · doi:10.1145/1132516.1132569
- klivans, 2001, Learning DNF in time 2O(n1/3), Proceedings of the 33rd Annual STOC
- 10.1587/transinf.E95.D.1531 · DOI · Paper page
- li, 2001, Cmar: Accurate and efficient classification based on multiple class-association rules, IEEE ICDM 2001, 369
- rudin, 2013, Learning theory analysis for association rules and sequential event prediction, JMLR, 14, 3384
- mccormick, 2012, A hierarchical model for association rule mining of sequential events: An approach to automated medical symptom prediction, Annals of Applied Statistics
- wang, 2015, Bayesian ors of ands for interpretable classification with application to context aware recommender systems
- 10.1016/0743-1066(94)90035-3 · DOI · Paper page
- bache, 2013, UCI Machine Learning Repository
- wang, 2015, Falling rule lists, Proc Int Conf Artificial Intelligence and Statistics (AISTATS)
- 10.1145/1133905.1133907 · DOI · Paper page
Cited by
Machine Learning Interpretability: A Survey on Methods and Metrics
Carvalho, D. V., Pereira, E. M., & Cardoso, J. S. (2019) · Electronics · doi:10.3390/electronics8080832 · Cited by 1,842
A Survey on the Explainability of Supervised Machine Learning
Burkart, N., & Huber, M. F. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12228 · Cited by 1,008
Human factors in model interpretability: Industry practices, challenges, and needs
Hong, S. R., Hullman, J., & Bertini, E. (2020) · Proceedings of the ACM on Human-Computer Interaction · doi:10.1145/3392878 · Cited by 219
A Survey of Methods for Explaining Black Box Models
Guidotti, R., Monreale, A., Ruggieri, S., Turini, F., Giannotti, F., & Pedreschi, D. (2019) · ACM Computing Surveys · doi:10.1145/3236009 · Cited by 629
Considerations for Evaluation and Generalization in Interpretable Machine Learning
Doshi-Velez, F., & Kim, B. (2018) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-319-98131-4_1 · Cited by 176
An Evaluation of the Human-Interpretability of Explanation
Lage, I., Chen, E., He, J., Narayanan, M., Kim, B., Gershman, S., & Doshi-Velez, F. (2019) · arXiv · doi:10.48550/arxiv.1902.00006 · Cited by 125
Self-citationA Nutritional Label for Rankings
Yang, K., Stoyanovich, J., Asudeh, A., Howe, B., Jagadish, H., & Miklau, G. (2018) · Proceedings of the 2018 International Conference on Management of Data · doi:10.1145/3183713.3193568 · Cited by 103
“With the exception of recent machine learning results that enable interpretability of particular classes of algorithms [6, 7, 12], recent scholarship on algorithmic accountability has primarily focused on enabling an analyst to retroactively verify particular properties rather than proactively exposing a standard suit…”
BackgroundExplainable Artificial Intelligence: a Systematic Review
Vilone, G., & Longo, L. (2020) · arXiv · doi:10.48550/arxiv.2006.00093 · Cited by 269
Explainable Sentiment Analysis with Applications in Medicine
Zucco, C., Liang, H., Fatta, G. D., & Cannataro, M. (2018) · 2018 IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm.2018.8621359 · Cited by 59
“A simpler way to evaluate interpretability is via a quantifiable proxy [42]: the interpretable algorithm is presented as an optimization of a class models that already are claimed to be interpretable [46].”
Method
Metadata
- Authors
- Wang, T., Rudin, C., Velez-Doshi, F., Liu, Y., Klampfl, E., & MacNeille, P.
- Venue
- 2016 IEEE 16th International Conference on Data Mining (ICDM)
- Publisher
- IEEE
- Published
- 2016-12
- Pages
- 1269-1274
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2584281025
- Cited by
- 45
- References
- 3
- FWCI
- 3.63
- Type
- conference paper
- 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.