Implementing Dempster's rule for hierarchical evidence
From MaRDI portal
Publication:1096411
DOI10.1016/0004-3702(87)90040-3zbMath0633.68093OpenAlexW2077563900MaRDI QIDQ1096411
Publication date: 1987
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(87)90040-3
complexity analysisbelief functionsDempster's rulediagnostic treesGordon and Shortliffe's algorithmhierarchical evidence
Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A METHOD OF MANAGING COMPLEX FUZZY INFORMATION, Focal points and their implications for Möbius transforms and Dempster-Shafer theory, SPECIALIZATION—A NEW CONCEPT FOR UNCERTAINTY HANDLING WITH BELIEF FUNCTIONS, Propagating belief functions in qualitative Markov trees, Dempster's rule of combination is {\#}P-complete, A mathematical theory of evidence turns 40, Graphical models for imprecise probabilities, The combination of multiple classifiers using an evidential reasoning approach, Expert system models for inference with imperfect knowledge: A comparative study, Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects, Measures of uncertainty in expert systems, Combining ambiguous evidence with respect to ambiguous a priori knowledge. II: Fuzzy logic, Can belief structures improve our understanding of safety climate survey data?, Singular sources mining using evidential conflict analysis, Incremental construction and evaluation of defeasible probabilistic models, COMBINATION METHODS AND CONFLICT HANDLING IN EVIDENTIAL THEORIES, A logic-based analysis of Dempster-Shafer theory, Efficient Möbius Transformations and Their Applications to D-S Theory, On the independence requirement in Dempster-Shafer theory for combining classifiers providing statistical evidence, Uncertainty management with imprecise knowledge with application to design, The consistency of Dempster-Shafer updating, Algorithms for combining belief functions, On the independence requirement in Dempster-Shafer theory for combining classifiers providing statistical evidence, A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective, A NEW METHOD TO CONSTRUCT MEMBERSHIP FUNCTIONS AND GENERATE WEIGHTED FUZZY RULES FROM TRAINING INSTANCES, Perspectives on the theory and practice of belief functions, Consonant approximations of belief functions, Unnamed Item, Induction of fuzzy rules and membership functions from training examples, A behavioral foundation for fuzzy measures, Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm, INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH, Dempster's rule for evidence ordered in a complete directed acyclic graph, The reliability of reasoning with unreliable arguments
Cites Work
- Fusion, propagation, and structuring in belief networks
- Propagating belief functions in qualitative Markov trees
- Probability judgment in artificial intelligence and expert systems. With discussion
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
- Unnamed Item
- Unnamed Item
