Propagating belief functions in qualitative Markov trees
From MaRDI portal
Publication:1100937
DOI10.1016/0888-613X(87)90024-7zbMath0641.68158MaRDI QIDQ1100937
Prakash P. Shenoy, Khaled Mellouli, Glenn R. Shafer
Publication date: 1987
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
partitionsDempster-Shafer theoryprobabilitybelief functionsDempster's rulecausal treesqualitative independencediagnostic treesBayesian propagationcombination of evidencepropagation of evidencequalitative Markov tree
Related Items
The transferable belief model, Algebraic structure of the families of compatible frames of discernment, Conditional independence in valuation-based systems, Ordered valuation algebras: A generic framework for approximating inference, A new combination of evidence based on compromise, SPECIALIZATION—A NEW CONCEPT FOR UNCERTAINTY HANDLING WITH BELIEF FUNCTIONS, Implementing Dempster's rule for hierarchical evidence, Logical and algorithmic properties of independence and their application to Bayesian networks, Probability propagation, A mathematical theory of evidence turns 40, Graphical models for imprecise probabilities, Fuzzy sets in a approximate reasoning. I: Inference with possibility distributions, Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects, ROUGH FUZZY SETS AND FUZZY ROUGH SETS*, FUZZY MEASURES AND FUZZY INTEGRALS: AN OVERVIEW, Frequency-calibrated belief functions: review and new insights, Belief function independence. II: The conditional case., Resource bounded and anytime approximation of belief function computations., Computing the decomposable entropy of belief-function graphical models, Propagating belief functions through constraint systems, Statistical consistency with Dempster's rule on diagnostic trees having uncertain performance parameters, On the complexity of belief network synthesis and refinement, Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation, Algorithms for combining belief functions, Inference in directed evidential networks based on the transferable belief model, On the semantics of fuzzy logic, Constructing belief functions from sample data using multinomial confidence regions, A theory of Gaussian belief functions, Incremental conditioning of lower and upper probabilities, Binary join trees for computing marginals in the Shenoy-Shafer architecture, Perspectives on the theory and practice of belief functions, Consonant approximations of belief functions, Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm, Information algebras in the theory of imprecise probabilities, an extension, Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem, Dempster's rule for evidence ordered in a complete directed acyclic graph, The reliability of reasoning with unreliable arguments, Random sets and fuzzy interval analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fusion, propagation, and structuring in belief networks
- Allocations of probability
- Constructive probability
- Weights of evidence and internal conflict for support functions
- Implementing Dempster's rule for hierarchical evidence
- Probability judgment in artificial intelligence and expert systems. With discussion
- Rough classification
- The combination of evidence
- Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies
- Lindley's Paradox
- Rough sets
- Upper and Lower Probability Inferences for Families of Hypotheses with Monotone Density Ratios
- Upper and Lower Probabilities Generated by a Random Closed Interval
