Rectifying Binary Classifiers
Open Access
- 28 September 2023
- book chapter
- Published by IOS Press
- p. 485-492
Abstract
We elaborate on the notion of rectification of a classifier Σ based on Boolean features, introduced in [10]. The purpose is to determine how to modify Σ when the way it classifies a given instance is considered incorrect since it conflicts with some expert knowledge T. Given Σ and T , postulates characterizing the way Σ must be changed into a new classifier Σ T that complies with T were presented. We focus here on the specific case of binary classifiers, i.e., there is a single target concept, and any instance is classified either as positive (an element of the concept), or as negative (an element of the complementary concept). In this specific case, our main contribution is twofold: (1) we show that there is a unique rectification operator satisfying the postulates, and (2) when Σ and T are Boolean circuits, we show how a classification circuit equivalent to Σ T can be computed in time linear in the size of Σ and T ; when Σ is a decision tree (resp. a random forest, a boosted tree) and T is a decision tree, a decision tree (resp. a random forest, a boosted tree) equivalent to Σ T can be computed in time polynomial in the size of Σ and T .Keywords
This publication has 14 references indexed in Scilit:
- Deep Neural Networks and Tabular Data: A SurveyIEEE Transactions on Neural Networks and Learning Systems, 2022
- Interpretable machine learning: Fundamental principles and 10 grand challengesStatistics Surveys, 2022
- From local explanations to global understanding with explainable AI for treesNature Machine Intelligence, 2020
- Abductive learning: towards bridging machine learning and logical reasoningScience China Information Sciences, 2019
- Explanation in artificial intelligence: Insights from the social sciencesArtificial Intelligence, 2019
- Peeking Inside the Black-Box: A Survey on Explainable Artificial Intelligence (XAI)IEEE Access, 2018
- A Survey of Methods for Explaining Black Box ModelsACM Computing Surveys, 2018
- Branching Programs and Binary Decision Diagrams2000
- A Decision-Theoretic Generalization of On-Line Learning and an Application to BoostingJournal of Computer and System Sciences, 1997
- Propositional knowledge base revision and minimal changeArtificial Intelligence, 1991