Credal networks under epistemic irrelevance: the sets of desirable gambles approach

DOI10.1016/J.IJAR.2014.07.002zbMATH Open1388.68264arXiv1208.1136OpenAlexW2138976187MaRDI QIDQ473383FDOQ473383

Authors: Jasper De Bock, Gert De Cooman 

Publication date: 24 November 2014

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1208.1136

Recommendations

• Credal networks under epistemic irrelevance
• Credal networks
• Epistemic irrelevance on sets of desirable gambles
• Epistemic irrelevance in credal nets: the case of imprecise Markov trees
• Graphoid properties of epistemic irrelevance and independence

zbMATH Keywords

epistemic irrelevancesets of desirable gamblesAD-separationcredal networksgraphoid propertiesirrelevant natural extension

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)

Cites Work

• Probabilistic graphical models.
• Identifying independence in bayesian networks
• Title not available (Why is that?)
• Towards a unified theory of imprecise probability
• Lower Previsions
• An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
• Epistemic irrelevance in credal nets: the case of imprecise Markov trees
• Notes on conditional previsions
• A survey of the theory of coherent lower previsions
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• The L-separation criterion for description of cs-independence models
• Graphoid properties of epistemic irrelevance and independence
• Robust Filtering Through Coherent Lower Previsions
• Accept \& reject statement-based uncertainty models
• Desirability
• Bayesian networks with imprecise probabilities: theory and application to classification
• Irrelevant and independent natural extension for sets of desirable gambles
• Notes on desirability and conditional lower previsions
• Sets of desirable gambles: conditioning, representation, and precise probabilities
• Independent natural extension
• Belief models: An order-theoretic investigation
• Epistemic irrelevance on sets of desirable gambles
• Credal networks
• Graphical models for imprecise probabilities
• Title not available (Why is that?)
• Computing lower and upper expectations under epistemic independence
• Exchangeability and sets of desirable gambles
• The CONEstrip Algorithm
• Bayesian Networks

Cited In (19)

• Independent natural extension for choice functions
• Epistemic irrelevance in credal nets: the case of imprecise Markov trees
• Desirability foundations of robust rational decision making
• Subjective causal networks and indeterminate suppositional credences
• Coherent choice functions, desirability and indifference
• Exposing some points of interest about non-exposed points of desirability
• The logic behind desirable sets of things, and its filter representation
• Graphoid properties of epistemic irrelevance and independence
• Irrelevant and independent natural extension for sets of desirable gambles
• On a notion of independence proposed by Teddy Seidenfeld
• Computing lower and upper expected first-passage and return times in imprecise birth-death chains
• Conformity and independence with coherent lower previsions
• A gentle approach to imprecise probability
• Lexicographic choice functions
• Epistemic irrelevance on sets of desirable gambles
• Thirty years of credal networks: specification, algorithms and complexity
• Modelling epistemic irrelevance with choice functions
• Approximate credal network updating by linear programming with applications to decision making
• Credal networks under epistemic irrelevance

This page was built for publication: Credal networks under epistemic irrelevance: the sets of desirable gambles approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q473383)