The following pages link to Credal networks (Q1575697):
Displaying 32 items.
- Updating credal networks is approximable in polynomial time (Q2375322) (← links)
- Approximate algorithms for credal networks with binary variables (Q2379306) (← links)
- Graphical models for imprecise probabilities (Q2386115) (← links)
- Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm (Q2386120) (← links)
- Quantifying the uncertainty of a belief net response: Bayesian error-bars for belief net inference (Q2389625) (← links)
- Imprecise probability trees: bridging two theories of imprecise probability (Q2389662) (← links)
- Introduction: Combining probability and logic (Q2390649) (← links)
- Credal networks under epistemic irrelevance (Q2409105) (← links)
- Imprecise continuous-time Markov chains (Q2411281) (← links)
- A behavioural justification for using sensitivity analysis in imprecise multinomial processes (Q2414018) (← links)
- Semi-qualitative probabilistic networks in computer vision problems (Q2431669) (← links)
- Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks (Q2509602) (← links)
- Evidential Networks from a Different Perspective (Q2805817) (← links)
- An Empirical Comparison of Bayesian and Credal Set Theory for Discrete State Estimation (Q3163974) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- Variable Elimination for Interval-Valued Influence Diagrams (Q3451214) (← links)
- IMPRECISE MARKOV CHAINS AND THEIR LIMIT BEHAVIOR (Q3644940) (← links)
- Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm (Q5227401) (← links)
- Probabilistic Inference in Credal Networks: New Complexity Results (Q5494858) (← links)
- Reasoning about causality in games (Q6103660) (← links)
- Making inferences in incomplete Bayesian networks: a Dempster-Shafer belief function approach (Q6137853) (← links)
- Subjective causal networks and indeterminate suppositional credences (Q6142423) (← links)
- Learning Sets of Bayesian Networks (Q6485231) (← links)
- Automatically finding the right probabilities in Bayesian networks (Q6488813) (← links)
- Efficient computation of counterfactual bounds (Q6577658) (← links)
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group (Q6577680) (← links)
- Learning sets of probabilities through ensemble methods (Q6587928) (← links)
- Markov conditions and factorization in logical credal networks (Q6596686) (← links)
- Representations of uncertainty in AI: beyond probability and possibility (Q6602218) (← links)
- Belief graphical models for uncertainty representation and reasoning (Q6602255) (← links)
- Languages for probabilistic modeling over structured and relational domains (Q6602256) (← links)
- A gentle approach to imprecise probability (Q6623871) (← links)
