Probabilistic rule induction for transparent CBR under uncertainty - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Artificial Intelligence XXXVIII: 41st SGAI International Conference on Artificial Intelligence Year : 2021

Probabilistic rule induction for transparent CBR under uncertainty

Abstract

CBR systems leverage past experiences to make decisions. Recently, the AI community has taken an interest in making CBR systems explainable. Logic-based frameworks make answers straightforward to explain. However, they struggle in the face of conflicting information, unlike probabilistic techniques. We show how probabilistic inductive logic programming (PILP) can be applied in CBR systems to make transparent decisions combining logic and probabilities. Then, we demonstrate how our approach can be applied in scenarios presenting uncertainty.
Fichier principal
Vignette du fichier
_HAL___Paper__EDM_PILP (1).pdf (391.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03337243 , version 1 (07-09-2021)

Identifiers

Cite

Martin Jedwabny, Pierre Bisquert, Madalina Croitoru. Probabilistic rule induction for transparent CBR under uncertainty. AI 2021 - 41st BCS SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence, Dec 2021, Cambridge, United Kingdom. pp.117-130, ⟨10.1007/978-3-030-91100-3_9⟩. ⟨hal-03337243⟩
83 View
102 Download

Altmetric

Share

Gmail Facebook X LinkedIn More