# A Voting Approach for Explainable Classification with Rule Learning

arXiv: https://arxiv.org/abs/2311.07323 · HTML: https://mlsanity.com/paper/2311.07323/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- Builds on 18 of its 57 references that are in the map.
- First posted on arXiv 13 Nov 2023.

## Builds on (most cited first, 18 of 18)

- [Language Models are Few-Shot Learners](https://mlsanity.com/paper/2005.14165/) (2020)
- [High-Resolution Image Synthesis with Latent Diffusion Models](https://mlsanity.com/paper/2112.10752/) (2021)
- [A Unified Approach to Interpreting Model Predictions](https://mlsanity.com/paper/1705.07874/) (2017)
- [XGBoost: A Scalable Tree Boosting System](https://mlsanity.com/paper/1603.02754/) (2016)
- ["Why Should I Trust You?": Explaining the Predictions of Any Classifier](https://mlsanity.com/paper/1602.04938/) (2016)
- [Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms](https://mlsanity.com/paper/1708.07747/) (2017)
- [DARTS: Differentiable Architecture Search](https://mlsanity.com/paper/1806.09055/) (2018)
- [A Survey on the Explainability of Supervised Machine Learning](https://mlsanity.com/paper/2011.07876/) (2020)
- [Explainable Artificial Intelligence: a Systematic Review](https://mlsanity.com/paper/2006.00093/) (2020)
- [Inductive logic programming at 30](https://mlsanity.com/paper/2102.10556/) (2021)
- [Interpreting Tree Ensembles with inTrees](https://mlsanity.com/paper/1408.5456/) (2014)
- [The Convolutional Tsetlin Machine](https://mlsanity.com/paper/1905.09688/) (2019)
- [An Ensemble of Simple Convolutional Neural Network Models for MNIST Digit Recognition](https://mlsanity.com/paper/2008.10400/) (2020)
- [Self-explaining AI as an alternative to interpretable AI](https://mlsanity.com/paper/2002.05149/) (2020)
- [Fine-Tuning DARTS for Image Classification](https://mlsanity.com/paper/2006.09042/) (2020)
- [Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples](https://mlsanity.com/paper/1802.07966/) (2018)
- [Rule Extraction from Binary Neural Networks with Convolutional Rules for Model Validation](https://mlsanity.com/paper/2012.08459/) (2020)
- [Evaluating Deep Neural Network Ensembles by Majority Voting cum Meta-Learning scheme](https://mlsanity.com/paper/2105.03819/) (2021)

## Built on by (most cited first, 2 of 2)

- [Towards consistency of rule-based explainer and black box model -- fusion of rule induction and XAI-based feature importance](https://mlsanity.com/paper/2407.14543/) (2024)
- [Rule by Rule: Learning with Confidence through Vocabulary Expansion](https://mlsanity.com/paper/2411.00049/) (2024)

## Abstract (arXiv)

State-of-the-art results in typical classification tasks are mostly achieved by unexplainable machine learning methods, like deep neural networks, for instance. Contrarily, in this paper, we investigate the application of rule learning methods in such a context. Thus, classifications become based on comprehensible (first-order) rules, explaining the predictions made. In general, however, rule-based classifications are less accurate than state-of-the-art results (often significantly). As main contribution, we introduce a voting approach combining both worlds, aiming to achieve comparable results as (unexplainable) state-of-the-art methods, while still providing explanations in the form of deterministic rules. Considering a variety of benchmark data sets including a use case of significant interest to insurance industries, we prove that our approach not only clearly outperforms ordinary rule learning methods, but also yields results on a par with state-of-the-art outcomes.
