Louenas Bounia

29 papers A* 3A 2Journal 7Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	—	`conf`	Abductive Relative Majoritary Explanations for Random Forest Classifiers in the Context of Multi-Class Classification. ICAART (3) Louenas Bounia, Juba Agoun
2026	—	`conf`	XDeepNN: An Explainable AI Framework for Identifying Adversarial Attacks. ICAART (2) Negar Zarei, Juba Agoun, Louenas Bounia
2025	—	`conf`	Approximation des explications abductives de taille minimale : application aux arbres de décision binaires. EGC Louenas Bounia
2025	—	`conf`	Calcul de meilleures explications pour les forêts aléatoires : Raisons k-majoritaires et Raisons probabilistes majoritaires. EGC Louenas Bounia
2025	—	`conf`	Computing Improved Explanations for Random Forests: k-Majoritary Reasons. ICAART (2) Louenas Bounia, Insaf Setitra
2025	—	`conf`	Computing an Approximating Version of a Minimum-Size Explanation for Boolean Decision Tree Classifiers. ICAART (2) Louenas Bounia
2025	J	`jnl`	Enhancing the intelligibility of decision trees with concise and reliable probabilistic explanations. Data Knowl. Eng. Louenas Bounia, Insaf Setitra
2025	—	`conf`	Explainable Profiling of Sleep Disorders to Support Trustworthy Clinical Interventions. ICDM (Workshops) Sifeddine Sellami, Juba Agoun, Lamia Yessad, Auday Berro, Louenas Bounia
2025	—	`conf`	Facial Empathy Analysis Through Deep Learning and Computer Vision Techniques in Mixed Reality Environments. ICAART (3) Insaf Setitra, Domitile Lourdeaux, Louenas Bounia
2025	J	`jnl`	Robust Explanations Through Uncertainty Decomposition: A Path to Trustworthier AI. CoRR Chenrui Zhu, Louenas Bounia, Vu-Linh Nguyen, Sébastien Destercke, Arthur Hoarau
2025	J	`jnl`	User Profiles of Sleep Disorder Sufferers: Towards Explainable Clustering and Differential Variable Analysis. CoRR Sifeddine Sellami, Juba Agoun, Lamia Yessad, Louenas Bounia
2025	A	`conf`	Using Submodular Optimization to Approximate Minimum-Size Abductive Path Explanations for Tree-Based Models. UAI Louenas Bounia
2024	—	`conf`	Améliorer l'intelligibilité des arbres de décision avec des explications probabilistes concises et fiables. EGC Louenas Bounia
2024	—	`conf`	Approximation des explications probabilistes via la minimisation super-modulaire. EGC Louenas Bounia, Frédéric Koriche
2024	—	`conf`	Enhancing the Intelligibility of Boolean Decision Trees with Concise and Reliable Probabilistic Explanations. IPMU (1) Louenas Bounia
2023	A	`conf`	Approximating probabilistic explanations via supermodular minimization. UAI Louenas Bounia, Frédéric Koriche
2023	—	`conf`	Impact of Weight Functions on Preferred Abductive Explanations for Decision Trees. ICCBR Workshops Louenas Bounia, Matthieu Goliot, Anasse Chafik
2023	—	`—`	Modéles formels pour l'IA explicable: des explications pour les arbres de décision. (Formal Models for Explainable AI: Explanations for Decision Trees). Louenas Bounia
2023	—	`conf`	PyXAI : calculer en Python des explications pour des modèles d'apprentissage supervisé. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Jean-Marie Lagniez, Pierre Marquis, Nicolas Szczepanski
2023	—	`conf`	Sur les explications abductives préférées pour les arbres de décision et les forêts aléatoires. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	—	`conf`	Les raisons majoritaires : des explications abductives pour les forêts aléatoires. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	A*	`conf`	On Preferred Abductive Explanations for Decision Trees and Random Forests. IJCAI Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	J	`jnl`	On the explanatory power of Boolean decision trees. Data Knowl. Eng. Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	—	`conf`	Sur le pouvoir explicatif des arbres de décision. EGC Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2022	A*	`conf`	Trading Complexity for Sparsity in Random Forest Explanations. AAAI Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	A*	`conf`	On the Computational Intelligibility of Boolean Classifiers. KR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	J	`jnl`	On the Computational Intelligibility of Boolean Classifiers. CoRR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	J	`jnl`	On the Explanatory Power of Decision Trees. CoRR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
2021	J	`jnl`	Trading Complexity for Sparsity in Random Forest Explanations. CoRR Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis