Epistemic irrelevance in credal nets: the case of imprecise Markov trees
From MaRDI portal
Publication:622263
DOI10.1016/J.IJAR.2010.08.011zbMATH Open1348.68248arXiv1008.2514OpenAlexW2101975205MaRDI QIDQ622263FDOQ622263
Filip Hermans, Gert De Cooman, M. Zaffalon, Alessandro Antonucci
Publication date: 31 January 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Abstract: We focus on credal nets, which are graphical models that generalise Bayesian nets to imprecise probability. We replace the notion of strong independence commonly used in credal nets with the weaker notion of epistemic irrelevance, which is arguably more suited for a behavioural theory of probability. Focusing on directed trees, we show how to combine the given local uncertainty models in the nodes of the graph into a global model, and we use this to construct and justify an exact message-passing algorithm that computes updated beliefs for a variable in the tree. The algorithm, which is linear in the number of nodes, is formulated entirely in terms of coherent lower previsions, and is shown to satisfy a number of rationality requirements. We supply examples of the algorithm's operation, and report an application to on-line character recognition that illustrates the advantages of our approach for prediction. We comment on the perspectives, opened by the availability, for the first time, of a truly efficient algorithm based on epistemic irrelevance.
Full work available at URL: https://arxiv.org/abs/1008.2514
Recommendations
- Credal networks under epistemic irrelevance
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- scientific article; zbMATH DE number 865677
- Reasoning with imprecise belief structures
- scientific article; zbMATH DE number 1164042
- Modelling epistemic irrelevance with choice functions
- Probabilistic inference in credal networks: new complexity results
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Notes on conditional previsions
- A survey of the theory of coherent lower previsions
- Decision making under uncertainty using imprecise probabilities
- Updating beliefs with incomplete observations
- Graphoid properties of epistemic irrelevance and independence
- Dilation for sets of probabilities
- Imprecise probability trees: bridging two theories of imprecise probability
- Marginal extension in the theory of coherent lower previsions
- Conservative Inference Rule for Uncertain Reasoning under Incompleteness
- Updating coherent previsions on finite spaces
- Independent natural extension
- Epistemic irrelevance on sets of desirable gambles
- Coherence graphs
- Credal networks
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Computing lower and upper expectations under epistemic independence
- Title not available (Why is that?)
Cited In (19)
- An aggregation framework based on coherent lower previsions: application to Zadeh's paradox and sensor networks
- Robust queueing theory: an initial study using imprecise probabilities
- Independent natural extension for infinite spaces
- Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks
- A New Method for Learning Imprecise Hidden Markov Models
- Imprecise continuous-time Markov chains
- Computing lower and upper expected first-passage and return times in imprecise birth-death chains
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Independent products in infinite spaces
- Independent natural extension
- Robust classification of multivariate time series by imprecise hidden Markov models
- Conditioning, updating and lower probability zero
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- Independence and 2-monotonicity: nice to have, hard to keep
- Updating credal networks is approximable in polynomial time
- Modelling epistemic irrelevance with choice functions
- Approximate credal network updating by linear programming with applications to decision making
- Tractable inference in credal sentential decision diagrams
- Credal networks under epistemic irrelevance
This page was built for publication: Epistemic irrelevance in credal nets: the case of imprecise Markov trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622263)
