Credal networks under epistemic irrelevance
From MaRDI portal
Publication:2409105
DOI10.1016/j.ijar.2017.03.012zbMath1419.68159arXiv1701.08661OpenAlexW4205606125MaRDI QIDQ2409105
Publication date: 11 October 2017
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.08661
lower expectationepistemic irrelevancecredal networksirrelevant natural extensionsets of probabilities
Related Items (6)
Subjective causal networks and indeterminate suppositional credences ⋮ Modelling epistemic irrelevance with choice functions ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Graphoid properties of concepts of independence for sets of probabilities ⋮ Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity ⋮ Independent natural extension for choice functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust queueing theory: an initial study using imprecise probabilities
- Sets of probability distributions, independence, and convexity
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Independent natural extension
- Graphoid properties of epistemic irrelevance and independence
- Epistemic irrelevance on sets of desirable gambles
- Computing lower and upper expectations under epistemic independence
- Notes on conditional previsions
- Conditioning, updating and lower probability zero
- Updating coherent previsions on finite spaces
- Statistical decision theory and Bayesian analysis. 2nd ed
- Bayes's two arguments for the rule of conditioning
- Finitely additive conditional probabilities, conglomerability and disintegrations
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Advances in the understanding and use of conditional independence
- A new understanding of subjective probability and its generalization to lower and upper prevision.
- Credal networks
- The L-separation criterion for description of cs-independence models
- Towards a unified theory of imprecise probability
- Coefficients of ergodicity for Markov chains with uncertain parameters
- Measures of uncertainty in expert systems
- A survey of the theory of coherent lower previsions
- An introduction to the imprecise Dirichlet model for multinomial data
- Graphical models for imprecise probabilities
- Probability and time
- Desirability
- Probabilistic graphical models
- Lower Previsions
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Conditional Probability
- Bayesian Inference with Specified Prior Marginals
- Convex Polytopes
- Robust Filtering Through Coherent Lower Previsions
- An Efficient Algorithm for Estimating State Sequences in Imprecise Hidden Markov Models
- Probabilistic Inference in Credal Networks: New Complexity Results
This page was built for publication: Credal networks under epistemic irrelevance
