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

DOI10.1016/J.INS.2020.10.060zbMATH Open1484.68244arXiv2011.06549OpenAlexW3105085896MaRDI QIDQ2124186FDOQ2124186

Franck Davoine, Véronique Cherfaoui, Maxime Chaveroche

Publication date: 14 April 2022

Published in: Information Sciences (Search for Journal in Brave)

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.

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

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?

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)

Cites Work

• Title not available (Why is that?)
• The transferable belief model
• Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
• On the foundations of combinatorial theory I. Theory of M�bius Functions
• Title not available (Why is that?)
• Fast Möbius inversion in semimodular lattices and ER-labelable posets
• Computational aspects of the Mobius transformation of graphs
• Fast Zeta Transforms for Lattices with Few Irreducibles
• Implementing Dempster's rule for hierarchical evidence
• A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
• Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
• Trimmed Moebius inversion and graphs of bounded degree
• Belief functions on lattices
• Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
• Algorithms for Dempster-Shafer theory
• Dempster-Shafer Reasoning in Large Partially Ordered Sets: Applications in Machine Learning
• Efficient Möbius Transformations and Their Applications to D-S Theory

Cited In (3)

• 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)