English
Related papers

Related papers: Quantifying knowledge with a new calculus for beli…

200 papers

We first discuss certain problems with the classical probabilistic approach for assessing forensic evidence, in particular its inability to distinguish between lack of belief and disbelief, and its inability to model complete ignorance…

Probability · Mathematics 2017-02-02 Timber Kerkvliet , Ronald Meester

The conditioning in the Dempster-Shafer Theory of Evidence has been defined (by Shafer \cite{Shafer:90} as combination of a belief function and of an "event" via Dempster rule. On the other hand Shafer \cite{Shafer:90} gives a…

Artificial Intelligence · Computer Science 2017-06-09 Andrzej Matuszewski , Mieczysław A. Kłopotek

Dempster-Shafer evidence theory has been widely used in various fields of applications, because of the flexibility and effectiveness in modeling uncertainties without prior information. However, the existing evidence theory is insufficient…

Artificial Intelligence · Computer Science 2019-06-28 Fuyuan Xiao

In this paper, we generalize the belief function on complex plane from another point of view. We first propose a new concept of complex mass function based on the complex number, called complex basic belief assignment, which is a…

Artificial Intelligence · Computer Science 2019-07-11 Fuyuan Xiao

The problem of combining beliefs in the Dempster-Shafer belief theory has attracted considerable attention over the last two decades. The classical Dempster's Rule has often been criticised, and many alternative rules for belief combination…

Artificial Intelligence · Computer Science 2007-05-23 Audun Josang

Shafer's belief functions were introduced in the seventies of the previous century as a mathematical tool in order to model epistemic probability. One of the reasons that they were not picked up by mainstream probability was the lack of a…

Probability · Mathematics 2017-03-27 Timber Kerkvliet , Ronald Meester

In Dempster-Shafer belief theory, general beliefs are expressed as belief mass distribution functions over frames of discernment. In Subjective Logic beliefs are expressed as belief mass distribution functions over binary frames of…

Artificial Intelligence · Computer Science 2007-05-23 Audun Josang

By analyzing the relationships among chance, weight of evidence and degree of beliefwe show that the assertion "probability functions are special cases of belief functions" and the assertion "Dempster's rule can be used to combine belief…

Artificial Intelligence · Computer Science 2013-02-28 Pei Wang

This paper describes a natural framework for rules, based on belief functions, which includes a repre- sentation of numerical rules, default rules and rules allowing and rules not allowing contraposition. In particular it justifies the use…

Artificial Intelligence · Computer Science 2013-04-05 Nic Wilson

In this paper, we generalize the basic notions and results of Dempster-Shafer theory from predicates to formal concepts. Results include the representation of conceptual belief functions as inner measures of suitable probability functions,…

Artificial Intelligence · Computer Science 2021-05-19 Sabine Frittella , Krishna Manoorkar , Alessandra Palmigiano , Apostolos Tzimoulis , Nachoem M. Wijnberg

This paper examines the relationship between Shafer's belief functions and convex sets of probability distributions. Kyburg's (1986) result showed that belief function models form a subset of the class of closed convex probability…

Artificial Intelligence · Computer Science 2013-04-11 Paul K. Black

In the canonical examples underlying Shafer-Dempster theory, beliefs over the hypotheses of interest are derived from a probability model for a set of auxiliary hypotheses. Beliefs are derived via a compatibility relation connecting the…

Artificial Intelligence · Computer Science 2013-04-11 Kathryn Blackmond Laskey

There are at least two ways to interpret numerical degrees of belief in terms of betting: (1) you can offer to bet at the odds defined by the degrees of belief, or (2) you can judge that a strategy for taking advantage of such betting…

Statistics Theory · Mathematics 2010-01-12 Glenn Shafer

While Evidence Theory (also known as Dempster-Shafer Theory, or Belief Functions Theory) is being increasingly used in data fusion, its potentialities in the Social and Life Sciences are often obscured by lack of awareness of its…

Artificial Intelligence · Computer Science 2025-03-31 Guido Fioretti

While belief functions may be seen formally as a generalization of probabilistic distributions, the question of the interactions between belief functions and probability is still an issue in practice. This question is difficult, since the…

Logic in Computer Science · Computer Science 2011-10-03 Frederic Dambreville

A primary motivation for reasoning under uncertainty is to derive decisions in the face of inconclusive evidence. However, Shafer's theory of belief functions, which explicitly represents the underconstrained nature of many reasoning…

Artificial Intelligence · Computer Science 2013-04-08 Thomas M. Strat

Considerable attention has been given to the problem of non-monotonic reasoning in a belief function framework. Earlier work (M. Ginsberg) proposed solutions introducing meta-rules which recognized conditional independencies in a…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish

This paper describes recent work on an ongoing project in medical diagnosis at the University of Guelph. A domain on which experts are not very good at pinpointing a single disease outcome is explored. On-line medical data is available over…

Artificial Intelligence · Computer Science 2013-04-05 Mary McLeish , P. Yao , T. Stirtzinger

This paper will focus on the process of 'fusing' several observations or models of uncertainty into a single resultant model. Many existing approaches to fusion use subjective quantities such as 'strengths of belief' and process these…

Artificial Intelligence · Computer Science 2020-07-28 Shawn C. Eastwood , Svetlana N. Yanushkevich

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our…

Discrete Mathematics · Computer Science 2008-11-21 Michel Grabisch
‹ Prev 1 2 3 10 Next ›