Graphical models for imprecise probabilities
From MaRDI portal
Recommendations
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Recent advances in imprecise-probabilistic graphical models
- Probabilistic graphical models
- scientific article; zbMATH DE number 1665314
- Learning from imprecise data: possibilistic graphical models.
- Probabilistic graphical models. Principles and applications
- Probabilistic graphical models. Principles and applications
- Graphical models
- Graphical models
Cites work
- scientific article; zbMATH DE number 992990 (Why is no real title available?)
- scientific article; zbMATH DE number 2129897 (Why is no real title available?)
- scientific article; zbMATH DE number 3934086 (Why is no real title available?)
- scientific article; zbMATH DE number 3688363 (Why is no real title available?)
- scientific article; zbMATH DE number 3720156 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3514748 (Why is no real title available?)
- scientific article; zbMATH DE number 1285158 (Why is no real title available?)
- scientific article; zbMATH DE number 1315585 (Why is no real title available?)
- scientific article; zbMATH DE number 1095142 (Why is no real title available?)
- scientific article; zbMATH DE number 1179517 (Why is no real title available?)
- scientific article; zbMATH DE number 2000104 (Why is no real title available?)
- scientific article; zbMATH DE number 1493045 (Why is no real title available?)
- scientific article; zbMATH DE number 845703 (Why is no real title available?)
- scientific article; zbMATH DE number 4189219 (Why is no real title available?)
- 10.1162/jmlr.2003.3.4-5.679
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- A logic for reasoning about probabilities
- A representation of partially ordered preferences
- Algorithms for imprecise probabilities
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Answering queries from context-sensitive probabilistic knowledge bases
- Anytime deduction for probabilistic logic
- Bounded-parameter Markov decision processes
- Causation, prediction, and search
- Computation in valuation algebras
- Credal networks
- Exact credal treatment of missing data
- Geometric foundations for interval-based probabilities
- Graphical models for associations between variables, some of which are qualitative and some quantitative
- Graphoid properties of epistemic irrelevance and independence
- Implementing Dempster's rule for hierarchical evidence
- Implicative analysis for multivariate binary data using an imprecise Dirichlet model
- Increased robustness of Bayesian networks through probability intervals
- Incremental conditioning of lower and upper probabilities
- Interval probability propagation
- Introducing situational influences in QPNs
- Markov Decision Processes with Imprecise Transition Probabilities
- Markov random fields and their applications
- Markovian Decision Processes with Uncertain Transition Probabilities
- Measures of uncertainty in expert systems
- Optimal control of diffusion processes with reflection
- Parameter Imprecision in Finite State, Finite Action Dynamic Programs
- Probabilistic Horn abduction and Bayesian networks
- Probabilistic Networks and Expert Systems
- Probabilistic logic
- Propagating belief functions in qualitative Markov trees
- Robust Bayes classifiers
- Robust Estimation of a Location Parameter
- Statistical decision theory and Bayesian analysis. 2nd ed
- Stochastic independence in a coherent setting
- Strong conditional independence for credal sets
- Talking probabilities: Communicating probabilistic information with words and numbers
- The naive credal classifier
- The theory of interval-probability as a unifying concept for uncertainty
- Tree-based credal networks for classification
- Two views of belief: Belief as generalized probability and belief as evidence
- Updating beliefs with incomplete observations
- Using kappas as indicators of strength in qualitative probabilistic networks
- Using probability trees to compute marginals with imprecise probabilities
Cited in
(30)- Probabilistic logic with independence
- Computing lower and upper expectations under epistemic independence
- Approximate algorithms for credal networks with binary variables
- Probabilistic causal bipolar abstract argumentation: an approach based on credal networks
- Robustifying sum-product networks
- Ranking discrete outcome alternatives with partially quantified uncertainty
- Pari-mutuel probabilities as an uncertainty model
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Implications of faithfulness in graphical models
- Joint propagation of probability and possibility in risk analysis: towards a formal framework
- Introduction to imprecise probabilities
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Model Uncertainty and Correctability for Directed Graphical Models
- Sequential decision making with partially ordered preferences
- Parameter Estimation for Undirected Graphical Models With Hard Constraints
- Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval
- A probabilistic graphical model based stochastic input model construction
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- The uncertainty of a selected graphical model
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Thirty years of credal networks: specification, algorithms and complexity
- Updating credal networks is approximable in polynomial time
- Imprecise probability trees: bridging two theories of imprecise probability
- On the complexity of propositional and relational credal networks
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Credal networks under epistemic irrelevance
This page was built for publication: Graphical models for imprecise probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386115)
