Feature necessity \& relevancy in ML classifier explanations
type: Item
instance of: scholarly article
title: Feature necessity \& relevancy in ML classifier explanations
DOI: 10.1007/978-3-031-30823-9_9
author: X. X. Huang
author: M. C. Cooper
author: Antonio Morgado
author: Jordi Planes
author: Joao Marques-Silva
publication date: 2023-12-13T00:00:00Z
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 7777304
zbMATH Keywords: formal explainability
zbMATH Keywords: abduction
zbMATH Keywords: abstraction refinement
MaRDI profile type: Publication
cites work: Binary Decision Diagrams
cites work: Computational Complexity
cites work: Q5148371
cites work: Q3680754
cites work: Random forests
cites work: Q3327527
cites work: Counterexample-guided abstraction refinement for symbolic model checking
cites work: Q4411139
cites work: On Quantifying Literals in Boolean Logic and its Applications to Explainable AI
cites work: The complexity of logic-based abduction
cites work: Machine learning. The art and science of algorithms that make sense of data.
cites work: Greedy function approximation: A gradient boosting machine.
cites work: Efficient Boolean manipulation with OBDD's can be extended to FBDD's
cites work: Q5270493
cites work: SAT-based rigorous explanations for decision lists
cites work: A SAT-based approach to learn explainable decision sets
cites work: On Tackling Explanation Redundancy in Decision Trees
cites work: Q4942611
cites work: Explanation in artificial intelligence: insights from the social sciences
cites work: Neural Networks
cites work: Understanding Machine Learning
cites work: The Computational Complexity of Understanding Binary Classifier Decisions
cites work: Branching Programs and Binary Decision Diagrams
description: scientific article; zbMATH DE number 7777304