CoChat

Bayesian Rule Sets for Interpretable Classification

Wang, Tong, Rudin, Cynthia, Velez-Doshi, Finale, Liu, Yimin, Klampfl, Erica, MacNeille, Perry · 2016 · 2016 IEEE 16th International Conference on Data Mining (ICDM)
Cited by 45

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/icdm.2016.0171

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 3 references

Research works printed but not linked: 21

  1. 10.1016/B978-1-55860-377-6.50023-2 · DOI · Paper page
  2. malioutov, 2013, Exact rule learning via boolean compressed sensing, ICML
  3. 10.1097/00003246-198811000-00006 · DOI · Paper page
  4. 10.1023/A:1008894516817 · DOI · Paper page
  5. 10.1007/BF00962234 · DOI · Paper page
  6. 10.1109/69.842268 · DOI · Paper page
  7. 10.1007/BF02283750 · DOI · Paper page
  8. 10.1509/jmkr.47.3.485 · DOI · Paper page
  9. 10.1145/2623330.2623648 · DOI · Paper page
  10. wang, 2016, Supplementary material for Bayesian Rule Sets for Interpretable Classification
  11. 10.1145/1132516.1132569 · doi:10.1145/1132516.1132569
  12. klivans, 2001, Learning DNF in time 2O(n1/3), Proceedings of the 33rd Annual STOC
  13. 10.1587/transinf.E95.D.1531 · DOI · Paper page
  14. li, 2001, Cmar: Accurate and efficient classification based on multiple class-association rules, IEEE ICDM 2001, 369
  15. rudin, 2013, Learning theory analysis for association rules and sequential event prediction, JMLR, 14, 3384
  16. mccormick, 2012, A hierarchical model for association rule mining of sequential events: An approach to automated medical symptom prediction, Annals of Applied Statistics
  17. wang, 2015, Bayesian ors of ands for interpretable classification with application to context aware recommender systems
  18. 10.1016/0743-1066(94)90035-3 · DOI · Paper page
  19. bache, 2013, UCI Machine Learning Repository
  20. wang, 2015, Falling rule lists, Proc Int Conf Artificial Intelligence and Statistics (AISTATS)
  21. 10.1145/1133905.1133907 · DOI · Paper page

Cited by

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.