Credal networks

DOI10.1016/S0004-3702(00)00029-1zbMATH Open0945.68163OpenAlexW2913772900MaRDI QIDQ1575697FDOQ1575697

Authors: Fabio G. Cozman 

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

Recommendations

• Thirty years of credal networks: specification, algorithms and complexity
• Credal networks under epistemic irrelevance
• scientific article; zbMATH DE number 2014741
• Approximate credal network updating by linear programming with applications to decision making
• Credal networks under epistemic irrelevance: the sets of desirable gambles approach

zbMATH Keywords

Bayesian networksindependence relationsrobust Bayesian analysislower and upper expectationsconvex sets of probability measuresgraphical \(d\)-separation relationsgraphical 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)

Cites Work

• Causation, prediction, and search
• Statistical decision theory and Bayesian analysis. 2nd ed
• Title not available (Why is that?)
• Title not available (Why is that?)
• Robust Bayesian analysis: sensitivity to the prior
• Measures of uncertainty in expert systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic logic
• Two views of belief: Belief as generalized probability and belief as evidence
• Title not available (Why is that?)
• Column Generation Methods for Probabilistic Logic
• Title not available (Why is that?)
• An Algorithm for Separable Nonconvex Programming Problems
• Geometric programming with signomials
• An approach to nonlinear programming
• Title not available (Why is that?)
• Towards a frequentist theory of upper and lower probability
• Bayes' theorem for Choquet capacities
• The computational complexity of probabilistic inference using Bayesian belief networks
• Bayesian and non-Bayesian evidential updating
• Title not available (Why is that?)
• 2U: an exact interval propagation algorithm for polytrees with binary variables
• Bayesian robustness in bidimensional models: Prior independence. (With discussion)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bayesian inference using intervals of measures
• Invariance properties of density ratio priors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Branch-and-Bound Method for Reversed Geometric Programming
• Title not available (Why is that?)
• Computing Bounds on Expectations
• Four results on randomized incremental constructions
• Incremental conditioning of lower and upper probabilities
• Title not available (Why is that?)
• Lower probability models for uncertainty and non-deterministic processes
• Interval probability propagation
• Title not available (Why is that?)
• Advances in geometric programming
• An axiomatic framework for propagating uncertainty in directed acyclic networks
• Sensitivity in Bayesian Statistics: The Prior and the Likelihood
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (86)

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

Uses Software

• Hull

This page was built for publication: Credal networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575697)