Coefficients of Relations for Probabilistic Reasoning
نویسنده
چکیده
and we have our "three" as . 003 I . 001. If this ratio is one, we have statistical independence between the events "car brand A" and "car has transaission trouble". The coefficient "three" in the exaaple above is a factor linking two conditional probabilities. Such factors are widely used in current expert systea codes. They are known as "likelihood ratios", "certainty factors", "confidence factors", "evidential factors" (and others), as applied to "weights", "evidence", "beliefs", "rule strengths", "possibilities" (and others), with the purpose of "coabine evidence", "aaintain truth", "update beliefs", "propagate uncertainties" (and others).
منابع مشابه
Load-Frequency Control: a GA based Bayesian Networks Multi-agent System
Bayesian Networks (BN) provides a robust probabilistic method of reasoning under uncertainty. They have been successfully applied in a variety of real-world tasks but they have received little attention in the area of load-frequency control (LFC). In practice, LFC systems use proportional-integral controllers. However since these controllers are designed using a linear model, the nonlinearities...
متن کاملLogical Relations in a Statistical Problem
This paper presents the progicnet programme. It proposes a general framework for probabilistic logic that can guide inference based on both logical and probabilistic input, and it introduces a common calculus for making inferences in the framework. After an introduction to the programme as such, it is illustrated by means of a toy example from psychometrics. It is shown that the framework and c...
متن کاملProbabilistic Region Connection Calculus
We present a novel probabilistic model and specification language for spatial relations. Qualitative spatial logics such as RCC are used for representation and reasoning about physical entities. Our probabilistic RCC semantics enables a more expressive representation of spatial relations. We observe that reasoning in this new framework can be hard. We address this difficulty by using a factored...
متن کاملStep-Indexed Logical Relations for Probability
It is well-known that constructing models of higher-order probabilistic programming languages is challenging. We show how to construct step-indexed logical relations for a probabilistic extension of a higher-order programming language with impredicative polymorphism and recursive types. We show that the resulting logical relation is sound and complete with respect to the contextual preorder and...
متن کاملA Logic For Inductive Probabilistic Reasoning
Inductive probabilistic reasoning is understood as the application of inference patterns that use statistical background information to assign (subjective) probabilities to single events. The simplest such inference pattern is direct inference: from “70% of As are Bs” and “a is an A” infer that a is a B with probability 0.7. Direct inference is generalized by Jeffrey’s rule and the principle of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 2 شماره
صفحات -
تاریخ انتشار 1988