Thirty years of credal networks: specification, algorithms and complexity
From MaRDI portal
Publication:2206469
Recommendations
- Credal networks
- Probabilistic inference in credal networks: new complexity results
- Approximate credal network updating by linear programming with applications to decision making
- On the complexity of propositional and relational credal networks
- Updating credal networks is approximable in polynomial time
Cites work
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- A Guided Tour of Artificial Intelligence Research
- Algorithms for imprecise probabilities
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Approximate algorithms for credal networks with binary variables
- Approximating credal network inferences by linear programming
- Bucket elimination: A unifying framework for reasoning
- Classification
- Computing lower and upper expectations under epistemic independence
- Credal ensembles of classifiers
- Credal networks
- Credal networks under epistemic irrelevance
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Decision making under uncertainty using imprecise probabilities
- Decision-theoretic specification of credal networks: a unified language for uncertain modeling with sets of Bayesian networks
- Enhanced qualitative probabilistic networks for resolving trade-offs
- Epistemic irrelevance on sets of desirable gambles
- Evaluating credal classifiers by utility-discounted predictive accuracy
- Evaluating interval-valued influence diagrams
- Extreme points of the credal sets generated by elementary comparative probabilities
- Fundamental concepts of qualitative probabilistic networks
- Graphical models for imprecise probabilities
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks
- scientific article; zbMATH DE number 5117149 (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 1341461 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1945067 (Why is no real title available?)
- scientific article; zbMATH DE number 1538127 (Why is no real title available?)
- scientific article; zbMATH DE number 4121482 (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?)
- Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks
- Independence properties of directed markov fields
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Interval probability propagation
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- Learning reliable classifiers from small or incomplete data sets: the naive credal classifier 2
- Learning with imprecise probabilities as model selection and averaging
- Modeling and Reasoning with Bayesian Networks
- Most probable explanations in Bayesian networks: complexity and tractability
- On nonparametric predictive inference and objective Bayesianism
- On the complexity of propositional and relational credal networks
- On the hardness of approximate reasoning
- On the semantics and complexity of probabilistic logic programs
- Partial identification of probability distributions.
- PP is as Hard as the Polynomial-Time Hierarchy
- Probabilistic graphical models
- Probabilistic graphical models.
- Probabilistic inference in credal networks: new complexity results
- Probabilistic logic
- PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
- Problems in multilinear programming.
- Programming with linear fractional functionals
- Robust classification of multivariate time series by imprecise hidden Markov models
- Robustifying the Viterbi algorithm
- Semi-qualitative probabilistic networks in computer vision problems
- Sensitivity analysis: An aid for belief-network quantification
- Sets of probability distributions, independence, and convexity
- Statistical design and analysis for intercropping experiments. Volume I: Two crops
- Statistical inference
- Stochastic independence in a coherent setting
- The multilabel naive credal classifier
- The Oxford handbook of probability and philosophy
- The theory of interval-probability as a unifying concept for uncertainty
- Tree-based credal networks for classification
- Updating beliefs with incomplete observations
- Updating credal networks is approximable in polynomial time
Cited in
(26)- On the complexity of belief network synthesis and refinement
- Credal networks
- Robustifying sum-product networks
- Decision programming for mixed-integer multi-stage optimization under uncertainty
- Tractable inference in credal sentential decision diagrams
- Editorial. Special issue on robustness in probabilistic graphical models
- Updating credal networks is approximable in polynomial time
- Reliable knowledge-based adaptive tests by credal networks
- Approximate inferring approach of goal-oriented Credal network based on intelligent algorithms
- Recent advances in imprecise-probabilistic graphical models
- scientific article; zbMATH DE number 2014741 (Why is no real title available?)
- Exploiting Bayesian network sensitivity functions for inference in credal networks
- On the complexity of propositional and relational credal networks
- Decision making with hierarchical credal sets
- Approximating credal network inferences by linear programming
- Probabilistic inference in credal networks: new complexity results
- Probabilistic causal bipolar abstract argumentation: an approach based on credal networks
- Subjective causal networks and indeterminate suppositional credences
- Learning Sets of Bayesian Networks
- Beyond tree-shaped credal probabilistic circuits
- Efficient computation of counterfactual bounds
- Markov conditions and factorization in logical credal networks
- The imprecise vertical barrier models for distorting lower probabilities
- Minimal elicitation for decision problems described by bounded probability assessments
- 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
This page was built for publication: Thirty years of credal networks: specification, algorithms and complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2206469)
