Credal networks

DOI10.1016/S0004-3702(00)00029-1zbMath0945.68163OpenAlexW2913772900MaRDI QIDQ1575697

Publication date: 21 August 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(00)00029-1

zbMATH Keywords

Bayesian networks independence relations robust Bayesian analysis lower and upper expectations convex sets of probability measures graphical \(d\)-separation relations graphical models of inference

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Related Items (69)

Graphoid properties of epistemic irrelevance and independence ⋮ Epistemic irrelevance on sets of desirable gambles ⋮ A graphical study of comparative probabilities ⋮ An Empirical Comparison of Bayesian and Credal Set Theory for Discrete State Estimation ⋮ Evaluating interval-valued influence diagrams ⋮ Variable Elimination for Interval-Valued Influence Diagrams ⋮ Updating credal networks is approximable in polynomial time ⋮ Approximate algorithms for credal networks with binary variables ⋮ A new score for adaptive tests in Bayesian and credal networks ⋮ Graphical models for imprecise probabilities ⋮ Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm ⋮ Satisficing, preferences, and social interaction: a new perspective ⋮ Imprecise probability trees: bridging two theories of imprecise probability ⋮ Introduction: Combining probability and logic ⋮ Credal networks under epistemic irrelevance ⋮ Fast algorithms for robust classification with Bayesian nets ⋮ Computing lower and upper expectations under epistemic independence ⋮ Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks ⋮ Sets of probability distributions, independence, and convexity ⋮ Imprecise continuous-time Markov chains ⋮ Compositional models for credal sets ⋮ A behavioural justification for using sensitivity analysis in imprecise multinomial processes ⋮ A symbolic algebra for the computation of expected utilities in multiplicative influence diagrams ⋮ On extreme points of p-boxes and belief functions ⋮ Epistemic irrelevance in credal nets: the case of imprecise Markov trees ⋮ Equivalences between maximum a posteriori inference in Bayesian networks and maximum expected utility computation in influence diagrams ⋮ Reasoning about causality in games ⋮ A new probabilistic constraint logic programming language based on a generalised distribution semantics ⋮ Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach ⋮ Subjective causal networks and indeterminate suppositional credences ⋮ Real-time dynamic programming for Markov decision processes with imprecise probabilities ⋮ Semi-qualitative probabilistic networks in computer vision problems ⋮ Probabilistic opinion pooling with imprecise probabilities ⋮ Demystifying dilation ⋮ Tractable inference in credal sentential decision diagrams ⋮ Modelling epistemic irrelevance with choice functions ⋮ An axiomatic framework for influence diagram computation with partially ordered preferences ⋮ Thirty years of credal networks: specification, algorithms and complexity ⋮ Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems ⋮ Efficient solutions to factored MDPs with imprecise transition probabilities ⋮ Using mathematical programming to solve factored Markov decision processes with imprecise probabilities ⋮ PRM inference using Jaffray \& Faÿ's local conditioning ⋮ Independent natural extension ⋮ Robustifying sum-product networks ⋮ Efficient belief propagation in second-order Bayesian networks for singly-connected graphs ⋮ Credal networks under epistemic irrelevance: the sets of desirable gambles approach ⋮ Independent products in infinite spaces ⋮ On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables ⋮ Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity ⋮ Information graphs and their use for Bayesian network graph construction ⋮ Open-world probabilistic databases: semantics, algorithms, complexity ⋮ A new heuristic for learning Bayesian networks from limited datasets: a real-time recommendation system application with RFID systems in grocery stores ⋮ On the complexity of propositional and relational credal networks ⋮ The multilabel naive credal classifier ⋮ Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks ⋮ Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval ⋮ Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks ⋮ Evidential Networks from a Different Perspective ⋮ Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods ⋮ Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm ⋮ IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR ⋮ Partially observable Markov decision processes with imprecise parameters ⋮ Updating coherent previsions on finite spaces ⋮ Learning with imprecise probabilities as model selection and averaging ⋮ A sixth bibliography of fractional programming ⋮ Approximate credal network updating by linear programming with applications to decision making ⋮ Extreme points of the credal sets generated by comparative probabilities ⋮ Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms ⋮ Updating beliefs with incomplete observations

Uses Software

Hull

Cites Work

This page was built for publication: Credal networks