Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
From MaRDI portal
Publication:1399497
DOI10.1016/S0888-613X(02)00073-7zbMath1033.68114OpenAlexW2063213794MaRDI QIDQ1399497
Amel Ben Yaghlane, Thierry Denoeux
Publication date: 30 July 2003
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0888-613x(02)00073-7
Related Items
Focal points and their implications for Möbius transforms and Dempster-Shafer theory, The combination of multiple classifiers using an evidential reasoning approach, Geometry of relative plausibility and relative belief of singletons, Distances in evidence theory: comprehensive survey and generalizations, Constructing and evaluating alternative frames of discernment, On the Orthogonal Projection of a Belief Function, Forward-Backward-Viterbi Procedures in the Transferable Belief Model for State Sequence Analysis Using Belief Functions, On the relative belief transform, 2CoBel: a scalable belief function representation for 2D discernment frames, Dynamic estimation of the discernment frame in belief function theory: application to object detection, Belief rule-based classification system: extension of FRBCS in belief functions framework, The Intersection Probability and Its Properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Consonant approximations of belief functions
- Uncertainty measures for evidential reasoning. I: A review
- Uncertainty measures for evidental reasoning. II: A new measure of total uncertainty
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
- Uncertainty-based information. Elements of generalized information theory
- Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
- Dempster's rule of combination is {\#}P-complete
- INNER AND OUTER APPROXIMATION OF BELIEF STRUCTURES USING A HIERARCHICAL CLUSTERING APPROACH
- Computational aspects of the Mobius transformation of graphs
