Credal networks
From MaRDI portal
Publication:1575697
DOI10.1016/S0004-3702(00)00029-1zbMATH Open0945.68163OpenAlexW2913772900MaRDI QIDQ1575697FDOQ1575697
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
Cites work
- scientific article; zbMATH DE number 3847327 (Why is no real title available?)
- scientific article; zbMATH DE number 3848997 (Why is no real title available?)
- scientific article; zbMATH DE number 3854205 (Why is no real title available?)
- scientific article; zbMATH DE number 3934086 (Why is no real title available?)
- scientific article; zbMATH DE number 3713109 (Why is no real title available?)
- scientific article; zbMATH DE number 3720156 (Why is no real title available?)
- scientific article; zbMATH DE number 3780952 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 1222282 (Why is no real title available?)
- scientific article; zbMATH DE number 1341461 (Why is no real title available?)
- scientific article; zbMATH DE number 480243 (Why is no real title available?)
- scientific article; zbMATH DE number 1095142 (Why is no real title available?)
- scientific article; zbMATH DE number 3451178 (Why is no real title available?)
- scientific article; zbMATH DE number 783783 (Why is no real title available?)
- scientific article; zbMATH DE number 869737 (Why is no real title available?)
- scientific article; zbMATH DE number 3304505 (Why is no real title available?)
- scientific article; zbMATH DE number 3201010 (Why is no real title available?)
- scientific article; zbMATH DE number 4189228 (Why is no real title available?)
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- A Branch-and-Bound Method for Reversed Geometric Programming
- Advances in geometric programming
- An Algorithm for Separable Nonconvex Programming Problems
- An approach to nonlinear programming
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Bayes' theorem for Choquet capacities
- Bayesian and non-Bayesian evidential updating
- Bayesian inference using intervals of measures
- Bayesian robustness in bidimensional models: Prior independence. (With discussion)
- Causation, prediction, and search
- Column Generation Methods for Probabilistic Logic
- Computing Bounds on Expectations
- Four results on randomized incremental constructions
- Geometric programming with signomials
- Incremental conditioning of lower and upper probabilities
- Interval probability propagation
- Invariance properties of density ratio priors
- Lower probability models for uncertainty and non-deterministic processes
- Measures of uncertainty in expert systems
- Probabilistic logic
- Robust Bayesian analysis: sensitivity to the prior
- Sensitivity in Bayesian Statistics: The Prior and the Likelihood
- Statistical decision theory and Bayesian analysis. 2nd ed
- The computational complexity of probabilistic inference using Bayesian belief networks
- Towards a frequentist theory of upper and lower probability
- Two views of belief: Belief as generalized probability and belief as evidence
Cited in
(92)- A gentle approach to imprecise probability
- Information graphs and their use for Bayesian network graph construction
- Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval
- Reliable knowledge-based adaptive tests by credal networks
- Automatically finding the right probabilities in Bayesian networks
- An empirical comparison of Bayesian and credal set theory for discrete state estimation
- Belief graphical models for uncertainty representation and reasoning
- Languages for probabilistic modeling over structured and relational domains
- Approximate inference in directed evidential networks with conditional belief functions using the Monte Carlo algorithm
- Subjective causal networks and indeterminate suppositional credences
- An axiomatic framework for influence diagram computation with partially ordered preferences
- Tractable inference in credal sentential decision diagrams
- Recent advances in imprecise-probabilistic graphical models
- Semi-qualitative probabilistic networks in computer vision problems
- Cumulative distribution networks and the derivative-sum-product algorithm: models and inference for cumulative distribution functions on graphs
- Thirty years of credal networks: specification, algorithms and complexity
- Learning Sets of Bayesian Networks
- Beyond tree-shaped credal probabilistic circuits
- Efficient computation of counterfactual bounds
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Evidential Networks from a Different Perspective
- Markov conditions and factorization in logical credal networks
- Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach
- Representations of uncertainty in AI: beyond probability and possibility
- Approximate credal network updating by linear programming with applications to decision making
- Variable elimination for interval-valued influence diagrams
- Evaluating interval-valued influence diagrams
- A new score for adaptive tests in Bayesian and credal networks
- Exploiting Bayesian network sensitivity functions for inference in credal networks
- Approximate algorithms for credal networks with binary variables
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Learning sets of probabilities through ensemble methods
- Independent products in infinite spaces
- Reasoning about causality in games
- Computing lower and upper expectations under epistemic independence
- Credal networks under epistemic irrelevance
- Using mathematical programming to solve factored Markov decision processes with imprecise probabilities
- Updating credal networks is approximable in polynomial time
- Open-world probabilistic databases: semantics, algorithms, complexity
- Updating beliefs with incomplete observations
- Imprecise continuous-time Markov chains
- A sixth bibliography of fractional programming
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR
- Extreme points of the credal sets generated by comparative probabilities
- Independent natural extension
- Graphoid properties of epistemic irrelevance and independence
- Sets of probability distributions, independence, and convexity
- Epistemic irrelevance in credal nets: the case of imprecise Markov trees
- Modelling epistemic irrelevance with choice functions
- The relational structure of belief networks
- Distribution-free continuous Bayesian belief nets
- Average behaviour in discrete-time imprecise Markov chains: a study of weak ergodicity
- On extreme points of p-boxes and belief functions
- Demystifying dilation
- Aleatoric and epistemic uncertainty in machine learning: an introduction to concepts and methods
- A symbolic algebra for the computation of expected utilities in multiplicative influence diagrams
- Imprecise probability trees: bridging two theories of imprecise probability
- Epistemic irrelevance on sets of desirable gambles
- A graphical study of comparative probabilities
- Fast algorithms for robust classification with Bayesian nets
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
- Efficient belief propagation in second-order Bayesian networks for singly-connected graphs
- Robustifying sum-product networks
- Learning with imprecise probabilities as model selection and averaging
- Bayesian networks with imprecise probabilities: theory and application to classification
- scientific article; zbMATH DE number 2014741 (Why is no real title available?)
- Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks
- Decision making with hierarchical credal sets
- 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
- Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
- Probabilistic opinion pooling with imprecise probabilities
- Probabilistic inference in credal networks: new complexity results
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Updating coherent previsions on finite spaces
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Exact distribution theory for belief net responses
- Introduction: Combining probability and logic
- Compositional models for credal sets
- Satisficing, preferences, and social interaction: a new perspective
- On the complexity of solving polytree-shaped limited memory influence diagrams with binary variables
- On the complexity of propositional and relational credal networks
- The multilabel naive credal classifier
- Quantifying the uncertainty of a belief net response: Bayesian error-bars for belief net inference
- Partially observable Markov decision processes with imprecise parameters
- Graphical models for imprecise probabilities
- 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
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- PRM inference using Jaffray \& Faÿ's local conditioning
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
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)
