Reasoning in evidential networks with conditional belief functions

AbstractIn the existing evidential networks applicable to belief functions, the relations among the variables are always represented by joint belief functions on the product space of the variables involved. In this paper, we use conditional belief functions to represent such relations in the network and show some relations between these two kinds of representations. We also present a propagation algorithm for such networks. By analyzing the properties of some special networks with conditional belief functions, called networks with partial dependency, we show that the computation for reasoning can be simplified

The belief noisy-or model applied to network reliability analysis

One difficulty faced in knowledge engineering for Bayesian Network (BN) is the quan-tification step where the Conditional Probability Tables (CPTs) are determined. The number of parameters included in CPTs increases exponentially with the number of parent variables. The most common solution is the application of the so-called canonical gates. The Noisy-OR (NOR) gate, which takes advantage of the independence of causal interactions, provides a logarithmic reduction of the number of parameters required to specify a CPT. In this paper, an extension of NOR model based on the theory of belief functions, named Belief Noisy-OR (BNOR), is proposed. BNOR is capable of dealing with both aleatory and epistemic uncertainty of the network. Compared with NOR, more rich information which is of great value for making decisions can be got when the available knowledge is uncertain. Specially, when there is no epistemic uncertainty, BNOR degrades into NOR. Additionally, different structures of BNOR are presented in this paper in order to meet various needs of engineers. The application of BNOR model on the reliability evaluation problem of networked systems demonstrates its effectiveness