Efficient Möbius Transformations and Their Applications to D-S Theory

DOI10.1007/978-3-030-35514-2_29zbMath1440.68284arXiv2107.07359OpenAlexW2992183460MaRDI QIDQ3297817

Franck Davoine, Maxime Chaveroche, Véronique Cherfaoui

Publication date: 20 July 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

Dempster-Shafer theoryefficiencydistributive latticeDSTbelief functionscomplexity reductionMöbius transformzeta transformmeet-closed subsetfast Möbius transformFMTinformation-basedjoin-closed subset

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• Fast Möbius inversion in semimodular lattices and ER-labelable posets
• Implementing Dempster's rule for hierarchical evidence
• Trimmed Moebius inversion and graphs of bounded degree
• Computational aspects of the Mobius transformation of graphs
• Information-Based Evaluation of Approximation Methods in Dempster-Shafer Theory
• Fast Zeta Transforms for Lattices with Few Irreducibles
• A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective