Pseudo Credal Networks for Inference With Probability Intervals



Estrada-Lugo, Hector Diego, Tolo, Silvia ORCID: 0000-0003-3547-7012, de Angelis, Marco and Patelli, Edoardo ORCID: 0000-0002-5007-7247
(2019) Pseudo Credal Networks for Inference With Probability Intervals. ASCE-ASME J Risk and Uncert in Engrg Sys Part B Mech Engrg, 5 (4).

[img] Text
Inference_ASME_corrected_final.pdf - Accepted Version

Download (237kB) | Preview

Abstract

<jats:title>Abstract</jats:title> <jats:p>The computation of the inference corresponds to an NP-hard problem even for a single connected credal network. The novel concept of pseudo networks is proposed as an alternative to reduce the computational cost of probabilistic inference in credal networks and overcome the computational cost of existing methods. The method allows identifying the combination of intervals that optimizes the probability values of each state of the queried variable from the credal network. In the case of no evidence, the exact probability bounds of the query variable are calculated. When new evidence is inserted into the network, the outer and inner approximations of the query variable are computed by means of the marginalization of the joint probability distributions of the pseudo networks. The applicability of the proposed methodology is shown by solving numerical case studies.</jats:p>

Item Type: Article
Depositing User: Symplectic Admin
Date Deposited: 07 Jun 2019 07:47
Last Modified: 16 Nov 2021 23:10
DOI: 10.1115/1.4044239
URI: https://livrepository.liverpool.ac.uk/id/eprint/3044746