Epistemic irrelevance in credal nets: the case of imprecise Markov trees
From MaRDI portal
Publication:622263
DOI10.1016/j.ijar.2010.08.011zbMath1348.68248arXiv1008.2514OpenAlexW2101975205MaRDI QIDQ622263
Filip Hermans, Marco Zaffalon, Alessandro Antonucci, Gert De Cooman
Publication date: 31 January 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1008.2514
Related Items (19)
Computing lower and upper expected first-passage and return times in imprecise birth-death chains ⋮ Updating credal networks is approximable in polynomial time ⋮ Credal networks under epistemic irrelevance ⋮ Imprecise continuous-time Markov chains ⋮ An aggregation framework based on coherent lower previsions: application to Zadeh's paradox and sensor networks ⋮ Conditioning, updating and lower probability zero ⋮ Independence and 2-monotonicity: nice to have, hard to keep ⋮ Tractable inference in credal sentential decision diagrams ⋮ Modelling epistemic irrelevance with choice functions ⋮ Independent natural extension ⋮ Independent natural extension for infinite spaces ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ Robust classification of multivariate time series by imprecise hidden Markov models ⋮ Independent products in infinite spaces ⋮ Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity ⋮ Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks ⋮ Approximate credal network updating by linear programming with applications to decision making ⋮ A New Method for Learning Imprecise Hidden Markov Models ⋮ Robust queueing theory: an initial study using imprecise probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Independent natural extension
- Updating beliefs with incomplete observations
- Graphoid properties of epistemic irrelevance and independence
- Epistemic irrelevance on sets of desirable gambles
- Coherence graphs
- Computing lower and upper expectations under epistemic independence
- Notes on conditional previsions
- Decision making under uncertainty using imprecise probabilities
- Updating coherent previsions on finite spaces
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Dilation for sets of probabilities
- Credal networks
- A survey of the theory of coherent lower previsions
- Imprecise probability trees: bridging two theories of imprecise probability
- Marginal extension in the theory of coherent lower previsions
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Conservative Inference Rule for Uncertain Reasoning under Incompleteness
This page was built for publication: Epistemic irrelevance in credal nets: the case of imprecise Markov trees
