pith. sign in

arxiv: 1208.1136 · v1 · pith:HYPLWNLSnew · submitted 2012-08-06 · 💻 cs.AI · math.PR

Credal nets under epistemic irrelevance

classification 💻 cs.AI math.PR
keywords epistemicirrelevancemodelsnetscredalimprecisenotionprobability
0
0 comments X
read the original abstract

We present a new approach to credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. Instead of applying the commonly used notion of strong independence, we replace it by the weaker notion of epistemic irrelevance. We show how assessments of epistemic irrelevance allow us to construct a global model out of given local uncertainty models and mention some useful properties. The main results and proofs are presented using the language of sets of desirable gambles, which provides a very general and expressive way of representing imprecise probability models.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.