Credal networks under epistemic irrelevance: the sets of desirable gambles approach
From MaRDI portal
(Redirected from Publication:473383)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 4189228 (Why is no real title available?)
- A survey of the theory of coherent lower previsions
- Accept \& reject statement-based uncertainty models
- An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
- Bayesian Networks
- Bayesian networks with imprecise probabilities: theory and application to classification
- Belief models: An order-theoretic investigation
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Computing lower and upper expectations under epistemic independence
- Credal networks
- Desirability
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Epistemic irrelevance on sets of desirable gambles
- Exchangeability and sets of desirable gambles
- Graphical models for imprecise probabilities
- Graphoid properties of epistemic irrelevance and independence
- Identifying independence in bayesian networks
- Independent natural extension
- Irrelevant and independent natural extension for sets of desirable gambles
- Lower Previsions
- Notes on conditional previsions
- Notes on desirability and conditional lower previsions
- Probabilistic graphical models.
- Robust Filtering Through Coherent Lower Previsions
- Sets of desirable gambles: conditioning, representation, and precise probabilities
- The CONEstrip algorithm
- The L-separation criterion for description of cs-independence models
- Towards a unified theory of imprecise probability
Cited in
(19)- Credal networks under epistemic irrelevance
- A gentle approach to imprecise probability
- Graphoid properties of epistemic irrelevance and independence
- Irrelevant and independent natural extension for sets of desirable gambles
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Independent natural extension for choice functions
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains
- Modelling epistemic irrelevance with choice functions
- Lexicographic choice functions
- Epistemic irrelevance on sets of desirable gambles
- Desirability foundations of robust rational decision making
- Subjective causal networks and indeterminate suppositional credences
- Thirty years of credal networks: specification, algorithms and complexity
- Coherent choice functions, desirability and indifference
- Exposing some points of interest about non-exposed points of desirability
- Approximate credal network updating by linear programming with applications to decision making
- Conformity and independence with coherent lower previsions
- On a notion of independence proposed by Teddy Seidenfeld
- The logic behind desirable sets of things, and its filter representation
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)
