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

نویسندگان

چکیده

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 information fusion with Dempster's rule, which is pointwise multiplication two zeta transforms, and optimal general algorithms have found get complete definition these transforms. Yet, it shown in this paper that transform its inverse, M\"obius transform, can be exactly simplified, fitting quantity contained belief functions. Beyond that, simplification actually works for any function on partially ordered set. It relies new notion we call focal point constitutes smallest domain both transforms defined. We demonstrate interest results DST, not only reduction most transformations between representations their fusion, also theoretical purposes. Indeed, provide generalization conjunctive decomposition evidence formulas uncovering how each weight tied corresponding mass function.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for Dempster-Shafer Theory

The method of reasoning with uncertain information known as Dempster-Shafer theory arose from the reinterpretation and development of work of Arthur Dempster [Dempster, 67; 68] by Glenn Shafer in his book a mathematical theory of evidence [Shafer, 76], and further publications e.g., [Shafer, 81; 90]. More recent variants of Dempster-Shafer theory include the Transferable Belief Model see e.g., ...

متن کامل

The Dempster-Shafer Theory

The initial work introducing Dempster-Shafer (D-S) theory is found in Dempster (1967) and Shafer (1976). Since its introduction the very name causes confusion, a more general term often used is belief functions (both used intermittently here). Nguyen (1978) points out, soon after its introduction, that the rudiments of D-S theory can be considered through distributions of random sets. More furt...

متن کامل

Qualitative Dempster - Shafer Theory

This paper introduces the idea of using the Dempster-Shafer theory of evidence with qualitative values. Dempster-Shafer theory is a formalism for reasoning under uncertainty which may be viewed as a generalisation of probability theory with special advantages in its treatment of ambiguous data and the ignorance arising from it. Here we are interested in applying the theory when the numbers that...

متن کامل

An Extended Approach for Dempster-Shafer Theory

The modeling of epistemic knowledge is a necessity of most systems dealing with some sort of artificial reasoning. There a re several formalisms able to mathematically model someone’s degrees of belief. A very popular one is the Bayesian Theory, which is based on a prior knowledge of a probability distribution. Another model is the Theory of Evidence, or DempskrShafer Theory, which provides a m...

متن کامل

Situations and Evidence for Identity Using Dempster-Shafer Theory

We present a computational framework for identity based on Barwise and Devlin’s situation theory. We present an example with constellations of situations identifying an individual to create what we call id-situations, where id-actions are performed, along with supporting situations. We use Semantic Web standards to represent and reason about the situations in our example. We show how to represe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information Sciences

سال: 2021

ISSN: ['0020-0255', '1872-6291']

DOI: https://doi.org/10.1016/j.ins.2020.10.060