Graphical models for imprecise probabilities
From MaRDI portal
Publication:2386115
DOI10.1016/j.ijar.2004.10.003zbMath1099.68111OpenAlexW1992865352MaRDI QIDQ2386115
Publication date: 22 August 2005
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2004.10.003
Related Items
Updating credal networks is approximable in polynomial time ⋮ Approximate algorithms for credal networks with binary variables ⋮ Probabilistic logic with independence ⋮ Imprecise probability trees: bridging two theories of imprecise probability ⋮ Credal networks under epistemic irrelevance ⋮ Computing lower and upper expectations under epistemic independence ⋮ Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks ⋮ Probabilistic causal bipolar abstract argumentation: an approach based on credal networks ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Efficient solutions to factored MDPs with imprecise transition probabilities ⋮ Sequential decision making with partially ordered preferences ⋮ Using mathematical programming to solve factored Markov decision processes with imprecise probabilities ⋮ Robustifying sum-product networks ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ On the complexity of propositional and relational credal networks ⋮ Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks ⋮ Pari-mutuel probabilities as an uncertainty model ⋮ Ranking discrete outcome alternatives with partially quantified uncertainty ⋮ Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval ⋮ Joint propagation of probability and possibility in risk analysis: towards a formal framework ⋮ IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Answering queries from context-sensitive probabilistic knowledge bases
- Updating beliefs with incomplete observations
- Graphoid properties of epistemic irrelevance and independence
- Statistical decision theory and Bayesian analysis. 2nd ed
- Probabilistic logic
- Implementing Dempster's rule for hierarchical evidence
- Propagating belief functions in qualitative Markov trees
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Two views of belief: Belief as generalized probability and belief as evidence
- Causation, prediction, and search
- Interval probability propagation
- Optimal control of diffusion processes with reflection
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Geometric foundations for interval-based probabilities
- Probabilistic Horn abduction and Bayesian networks
- Anytime deduction for probabilistic logic
- Using probability trees to compute marginals with imprecise probabilities
- Tree-based credal networks for classification
- Credal networks
- Bounded-parameter Markov decision processes
- Stochastic independence in a coherent setting
- Strong conditional independence for credal sets
- The theory of interval-probability as a unifying concept for uncertainty
- Talking probabilities: Communicating probabilistic information with words and numbers
- The naive credal classifier
- Implicative analysis for multivariate binary data using an imprecise Dirichlet model
- Exact credal treatment of missing data
- Incremental conditioning of lower and upper probabilities
- Increased robustness of Bayesian networks through probability intervals
- A logic for reasoning about probabilities
- A representation of partially ordered preferences
- Measures of uncertainty in expert systems
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Markov Random Fields and Their Applications
- Parameter Imprecision in Finite State, Finite Action Dynamic Programs
- Probabilistic Networks and Expert Systems
- Markov Decision Processes with Imprecise Transition Probabilities
- 10.1162/jmlr.2003.3.4-5.679
- Markovian Decision Processes with Uncertain Transition Probabilities
- Robust Estimation of a Location Parameter
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Robust Bayes classifiers
This page was built for publication: Graphical models for imprecise probabilities
