Trading Complexity for Sparsity in Random Forest Explanations

Autor: Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis

Publikováno v: HAL

Random forests have long been considered as powerful model ensembles in machine learning. By training multiple decision trees, whose diversity is fostered through data and feature subsampling, the resulting random forest can lead to more stable and r

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::12371cd2f3c9138f222489cf83d5429e
https://doi.org/10.1609/aaai.v36i5.20484

On Preferred Abductive Explanations for Decision Trees and Random Forests

Autor: Gilles Audemard, Steve Bellart, Louenas Bounia, Frederic Koriche, Jean-Marie Lagniez, Pierre Marquis

Publikováno v: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence.

Abductive explanations take a central place in eXplainable Artificial Intelligence (XAI) by clarifying with few features the way data instances are classified. However, instances may have exponentially many minimum-size abductive explanations, and th

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::79e25e7f2e3ae76e7adc26870f587ce7
https://doi.org/10.24963/ijcai.2022/91

On the Computational Intelligibility of Boolean Classifiers

Autor: Louenas Bounia, Jean-Marie Lagniez, Pierre Marquis, Steve Bellart, Frédéric Koriche, Gilles Audemard

Publikováno v: 18th International Conference on Principles of Knowledge Representation and Reasoning {KR-2021}
18th International Conference on Principles of Knowledge Representation and Reasoning, Nov 2020, Hanoii, France. pp.74-86, ⟨10.24963/kr.2021/8⟩
KR
18th International Conference on Principles of Knowledge Representation and Reasoning, Nov 2021, Hanoii, France. pp.74-86, ⟨10.24963/kr.2021/8⟩

In this paper, we investigate the computational intelligibility of Boolean classifiers, characterized by their ability to answer XAI queries in polynomial time. The classifiers under consideration are decision trees, DNF formulae, decision lists, dec

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6065a7b780061c0abd1cb88a35eed3c9
https://hal.archives-ouvertes.fr/hal-03500007