Focal points and their implications for Möbius transforms and Dempster-Shafer theory

DOI10.1016/J.INS.2020.10.060MaRDI QIDQ2124186zbMATH OpenOpenAlexFDO

Authors Maxime Chaveroche, Franck Davoine, Véronique Cherfaoui

Publication date 14 April 2022

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2011.06549

zbMATH Keywords

efficiencycomplexity reductionDempster-Shafer theoryzeta transformgeneralized conjunctive decompositionMöbius transform

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Abstract: Dempster-Shafer Theory (DST) generalizes Bayesian probability theory, offering useful additional information, but suffers from a much higher computational burden. A lot of work has been done to reduce the time complexity of information fusion with Dempster's rule, which is a pointwise multiplication of two zeta transforms, and optimal general algorithms have been found to get the complete definition of these transforms. Yet, it is shown in this paper that the zeta transform and its inverse, the M"obius transform, can be exactly simplified, fitting the quantity of information contained in belief functions. Beyond that, this simplification actually works for any function on any partially ordered set. It relies on a new notion that we call focal point and that constitutes the smallest domain on which both the zeta and M"obius transforms can be defined. We demonstrate the interest of these general results for DST, not only for the reduction in complexity of most transformations between belief representations and their fusion, but also for theoretical purposes. Indeed, we provide a new generalization of the conjunctive decomposition of evidence and formulas uncovering how each decomposition weight is tied to the corresponding mass function.

Recommendations

• Efficient Möbius transformations and their applications to D-S theory
• Computational aspects of the Mobius transformation of graphs
• scientific article; zbMATH DE number 19879
• A logic-based analysis of Dempster-Shafer theory
• The combination of belief: When and how fast?

Cites work

• scientific article; zbMATH DE number 3560492 (Why is no real title available?)
• scientific article; zbMATH DE number 3271180 (Why is no real title available?)
• A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
• Algorithms for Dempster-Shafer theory
• Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
• Belief functions on lattices
• Computational aspects of the Mobius transformation of graphs
• Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
• Dempster-Shafer reasoning in large partially ordered sets: applications in machine learning
• Efficient Möbius transformations and their applications to D-S theory
• Fast Möbius inversion in semimodular lattices and ER-labelable posets
• Fast Zeta Transforms for Lattices with Few Irreducibles
• Implementing Dempster's rule for hierarchical evidence
• Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• The transferable belief model
• Trimmed Moebius inversion and graphs of bounded degree

Cited in

(4)

• Efficient Möbius transformations and their applications to D-S theory
• Computational aspects of the Mobius transformation of graphs
• A cloud model-based interval-valued evidence fusion method and its application in fault diagnosis
• A similarity measure of complex-valued evidence theory for multi-source information fusion

This page was built for publication: Focal points and their implications for Möbius transforms and Dempster-Shafer theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2124186)