A simplified algorithm for inference by lower conditional probabilities
نویسندگان
چکیده
Thanks to the notion of locally strong coherence, the satisfiability of proper logical conditions on subfamilies of the initial domain helps to simplify inferential processes based on lower conditional assessments. Actually, these conditions avoid also round errors that, on the other hand, appear solving numerical systems. In this paper we introduce new conditions to be applied to sets of particular pairs of events. With respect to more general conditions already proposed, they avoid an exhaustive search, so that a sensible time-complexity reduction is possible. The usefulness of these rules in inferential processes is shown by a diagnostic medical problem with thyroid pathology.
منابع مشابه
Inference in Bayesian Networks :
Three kinds of independence are of interest in the context of Bayesian networks, namely conditional independence, independence of causal in uence, and context-speci c independence. It is well-known that conditional independence enables one to factorize a joint probability into a list of conditional probabilities and thereby renders inference feasible. It has recently been shown that independenc...
متن کاملAn Introduction to Inference and Learning in Bayesian Networks
Bayesian networks (BNs) are modern tools for modeling phenomena in dynamic and static systems and are used in different subjects such as disease diagnosis, weather forecasting, decision making and clustering. A BN is a graphical-probabilistic model which represents causal relations among random variables and consists of a directed acyclic graph and a set of conditional probabilities. Structure...
متن کاملBayesian Inference under Ambiguity: Conditional Prior Belief Functions
Bayesian inference under imprecise prior information is studied: the starting point is a precise strategy σ and a full B-conditional prior belief functionBelB , conveying ambiguity in probabilistic prior information. In finite spaces, we give a closed form expression for the lower envelope P of the class of full conditional probabilities dominating {BelB , σ} and, in particular, for the related...
متن کاملEGL2U: Tractable Inference on Large Scale Credal Networks
Credal networks [1, 2] generalize Bayesian networks [3] by associating with variables (closed convex) sets of conditional probability mass functions, i.e., credal sets1, in place of precise conditional probability distributions. Credal networks are models of imprecise probabilities [4], which allow the capturing of incompleteness and imprecision of human knowledge and beliefs [1]. Credal networ...
متن کاملAn Optimal Approximation Algorithm for Bayesian Inference
Approximating the inference probability Pr X xjE e in any sense even for a single evidence node E is NP hard This result holds for belief networks that are allowed to contain extreme conditional probabilities that is conditional probabilities arbitrarily close to Nevertheless all previous approximation algorithms have failed to approximate e ciently many inferences even for belief networks with...
متن کامل