Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
From MaRDI portal
Publication:1809376
DOI10.1016/S0888-613X(97)00013-3zbMath0939.68109arXiv1302.3557MaRDI QIDQ1809376
Publication date: 20 December 1999
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3557
Knowledge representation (68T30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (28)
Ordered valuation algebras: A generic framework for approximating inference ⋮ Approximation techniques for the transformation of fuzzy sets into random sets ⋮ HOW TO RANDOMLY GENERATE MASS FUNCTIONS ⋮ Analytic hierarchy process for multi-sensor data fusion based on belief function theory ⋮ ON POSSIBILISTIC AND PROBABILISTIC APPROXIMATIONS OF UNRESTRICTED BELIEF FUNCTIONS BASED ON THE CONCEPT OF FUZZY T-PREORDER ⋮ On the combination and normalization of interval-valued belief structures ⋮ A Gibbs Sampler for a Class of Random Convex Polytopes ⋮ Geometry of relative plausibility and relative belief of singletons ⋮ Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame. ⋮ Resource bounded and anytime approximation of belief function computations. ⋮ Belief and Plausibility Functions on the Space of Scalar Products and Applications ⋮ The evidential reasoning approach for multiple attribute decision analysis using interval belief degrees ⋮ Distances in evidence theory: comprehensive survey and generalizations ⋮ Classification systems based on rough sets under the belief function framework ⋮ On the Orthogonal Projection of a Belief Function ⋮ On the relative belief transform ⋮ New distances between bodies of evidence based on Dempsterian specialization matrices and their consistency with the conjunctive combination rule ⋮ APPROXIMATION OF BELIEF FUNCTIONS ⋮ Towards an Alarm for Opposition Conflict in a Conjunctive Combination of Belief Functions ⋮ Classification with Dynamic Reducts and Belief Functions ⋮ Color image segmentation based on three levels of texture statistical evaluation ⋮ Indistinguishability relations in Dempster-Shafer theory of evidence ⋮ Environmental impact assessment using the evidential reasoning approach ⋮ The evidential reasoning approach for multi-attribute decision analysis under interval uncertainty ⋮ The Intersection Probability and Its Properties ⋮ INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH ⋮ The evidential reasoning approach for mada under both probabilistic and fuzzy uncertainties ⋮ Interpreting evidential distances by connecting them to partial orders: application to belief function approximation
Cites Work
- Unnamed Item
- Consonant approximations of belief functions
- Uncertainty and intelligent systems. 2nd International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems IPMU '88, Urbino, Italy, July 4-7, 1988. Proceedings.
- Dempster's rule of combination is {\#}P-complete
- A computationally efficient approximation of Dempster-Shafer theory
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
This page was built for publication: Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
