Thirty years of credal networks: specification, algorithms and complexity
From MaRDI portal
Publication:2206469
DOI10.1016/j.ijar.2020.08.009zbMath1490.68229OpenAlexW3081185273WikidataQ122112527 ScholiaQ122112527MaRDI QIDQ2206469
Denis Deratani Mauá, Fabio Gagliardi Cozman
Publication date: 22 October 2020
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2020.08.009
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Probabilistic graphical models (62H22)
Related Items (3)
Probabilistic causal bipolar abstract argumentation: an approach based on credal networks ⋮ Editorial. Special issue on robustness in probabilistic graphical models ⋮ Decision programming for mixed-integer multi-stage optimization under uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sets of probability distributions, independence, and convexity
- Most probable explanations in Bayesian networks: complexity and tractability
- Credal networks under epistemic irrelevance: the sets of desirable gambles approach
- Robust classification of multivariate time series by imprecise hidden Markov models
- On the complexity of propositional and relational credal networks
- The multilabel naive credal classifier
- Statistical design and analysis for intercropping experiments. Volume I: Two crops
- Updating beliefs with incomplete observations
- Epistemic irrelevance on sets of desirable gambles
- On nonparametric predictive inference and objective Bayesianism
- Computing lower and upper expectations under epistemic independence
- 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
- Decision making under uncertainty using imprecise probabilities
- Probabilistic logic
- Interval probability propagation
- 2U: an exact interval propagation algorithm for polytrees with binary variables
- Problems in multilinear programming.
- Tree-based credal networks for classification
- Credal networks
- Stochastic independence in a coherent setting
- The theory of interval-probability as a unifying concept for uncertainty
- Credal ensembles of classifiers
- Partial identification of probability distributions.
- Bucket elimination: A unifying framework for reasoning
- Learning with imprecise probabilities as model selection and averaging
- Kuznetsov independence for interval-valued expectations and sets of probability distributions: properties and algorithms
- An axiomatic framework for propagating uncertainty in directed acyclic networks
- Evaluating interval-valued influence diagrams
- Updating credal networks is approximable in polynomial time
- Evaluating credal classifiers by utility-discounted predictive accuracy
- Approximate algorithms for credal networks with binary variables
- Graphical models for imprecise probabilities
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm
- Enhanced qualitative probabilistic networks for resolving trade-offs
- Credal networks under epistemic irrelevance
- Semi-qualitative probabilistic networks in computer vision problems
- Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks
- Fundamental concepts of qualitative probabilistic networks
- On the hardness of approximate reasoning
- Sensitivity analysis: an aid for belief-network quantification
- The Oxford Handbook of Probability and Philosophy
- Statistical inference
- Probabilistic graphical models
- Classification
- Robustifying the Viterbi Algorithm
- PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
- PP is as Hard as the Polynomial-Time Hierarchy
- Modeling and Reasoning with Bayesian Networks
- Inference and learning in probabilistic logic programs using weighted Boolean formulas
- Independence properties of directed markov fields
- Approximating Credal Network Inferences by Linear Programming
- Extreme Points of the Credal Sets Generated by Elementary Comparative Probabilities
- Programming with linear fractional functionals
- On the Semantics and Complexity of Probabilistic Logic Programs
- Probabilistic Inference in Credal Networks: New Complexity Results
This page was built for publication: Thirty years of credal networks: specification, algorithms and complexity
