Using probability trees to compute marginals with imprecise probabilities
From MaRDI portal
Recommendations
- Computing intervals of probabilities with simulated annealing and probability trees
- Computing probability intervals with simulated annealing and probability trees
- Algorithms for imprecise probabilities
- Computing upper and lower bounds in interval decision trees
- PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
Cites work
- A Bounded Derivative Model for Prior Ignorance about a Real‐valued Parameter
- Algorithms for imprecise probabilities
- An overview of robust Bayesian analysis. (With discussion)
- Efficient inference in Bayes networks as a combinatorial optimization problem
- Exploiting case-based independence for approximating marginal probabilities
- Fuzzy sets as a basis for a theory of possibility
- scientific article; zbMATH DE number 41270 (Why is no real title available?)
- scientific article; zbMATH DE number 41471 (Why is no real title available?)
- scientific article; zbMATH DE number 48344 (Why is no real title available?)
- scientific article; zbMATH DE number 193123 (Why is no real title available?)
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- scientific article; zbMATH DE number 3613880 (Why is no real title available?)
- scientific article; zbMATH DE number 465666 (Why is no real title available?)
- scientific article; zbMATH DE number 1149408 (Why is no real title available?)
- scientific article; zbMATH DE number 1553119 (Why is no real title available?)
- scientific article; zbMATH DE number 845703 (Why is no real title available?)
- scientific article; zbMATH DE number 3433226 (Why is no real title available?)
- scientific article; zbMATH DE number 4189219 (Why is no real title available?)
- Importance sampling in Bayesian networks using probability trees.
- Interval probability propagation
- Measures of uncertainty in expert systems
- On Information and Sufficiency
- PROBABILITY INTERVALS: A TOOL FOR UNCERTAIN REASONING
- Removing partial inconsistency in valuation-based systems
- Robust Statistics
- Some characterizations of lower probabilities and other monotone capacities through the use of Möbius inversion
- The theory of interval-probability as a unifying concept for uncertainty
- Towards a unified theory of imprecise probability
- Upper and Lower Probabilities Induced by a Multivalued Mapping
Cited in
(23)- Decision making with interval probabilities
- Computing posterior upper expectations
- Distribution network risk assessment using multicriteria fuzzy influence diagram
- Anytime anyspace probabilistic inference
- Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval
- Learning recursive probability trees from probabilistic potentials
- 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
- Imprecise probability trees: bridging two theories of imprecise probability
- Comparing Averaged-Out Utilities of Probability Trees Having Random Parameters
- Ranking discrete outcome alternatives with partially quantified uncertainty
- Tree-growing with probabilistically imprecise data
- Computing probability intervals with simulated annealing and probability trees
- Eliciting dual interval probabilities from interval comparison matrices
- Approximations of one-dimensional expected utility integral of alternatives described with linearly-interpolated \(p\)-boxes
- Computing intervals of probabilities with simulated annealing and probability trees
- Efficient solutions to factored MDPs with imprecise transition probabilities
- Centralized ordered weighted averaging operator weights and their properties
- Computing upper and lower bounds in interval decision trees
- 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
- Degree of imprecision: geometric and algorithmic approaches
This page was built for publication: Using probability trees to compute marginals with imprecise probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1347925)
