On Shapley value interpretability in concept-based learning with formal concept analysis

DOI10.1007/S10472-022-09817-YOpenAlexW4309700918MaRDI QIDQ2107486

Dmitry I. Ignatov, Léonard Kwuida

Publication date: 1 December 2022

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-022-09817-y

zbMATH Keywords

Shapley valueclosed itemsetsformal conceptsrule-based learninginterpretable machine learningBanzhaf-Penrose index

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Complete lattices, completions (06B23) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (1)

On the number of maximal antichains in Boolean lattices for \(n\) up to 7

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical aspects of concept analysis
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Games on concept lattices: Shapley value and core
• Algorithms for computing the Shapley value of cooperative games on lattices
• Interpretable concept-based classification with Shapley values
• On interestingness measures of formal concepts
• A note on limit results for the Penrose-Banzhaf index
• On stability of a formal concept
• Conceptual Exploration
• Approximating Concept Stability
• On the complexity of calculating factorials
• Towards Concise Representation for Taxonomies of Epistemic Communities
• Concept Lattices

This page was built for publication: On Shapley value interpretability in concept-based learning with formal concept analysis