English
Related papers

Related papers: Rules, Belief Functions and Default Logic

200 papers

We revisit logistic regression and its nonlinear extensions, including multilayer feedforward neural networks, by showing that these classifiers can be viewed as converting input or higher-level features into Dempster-Shafer mass functions…

Machine Learning · Computer Science 2019-12-13 Thierry Denoeux

Probability theory and Dempster-Shafer theory are two germane theories to represent and handle uncertain information. Recent study suggested a transformation to obtain the negation of a probability distribution based on the maximum entropy.…

Artificial Intelligence · Computer Science 2019-01-30 Xinyang Deng , Wen Jiang

In this chapter, we present and discuss a new generalized proportional conflict redistribution rule. The Dezert-Smarandache extension of the Demster-Shafer theory has relaunched the studies on the combination rules especially for the…

Artificial Intelligence · Computer Science 2008-12-18 Arnaud Martin , Christophe Osswald

Parameter estimation based on uncertain data represented as belief structures is one of the latest problems in the Dempster-Shafer theory. In this paper, a novel method is proposed for the parameter estimation in the case where belief…

Artificial Intelligence · Computer Science 2014-02-18 Xinyang Deng , Yong Hu , Felix Chan , Sankaran Mahadevan , Yong Deng

We introduce a general theory of epistemic random fuzzy sets for reasoning with fuzzy or crisp evidence. This framework generalizes both the Dempster-Shafer theory of belief functions, and possibility theory. Independent epistemic random…

Artificial Intelligence · Computer Science 2024-05-08 Thierry Denoeux

In this paper, we suggest marrying Dempster-Shafer (DS) theory with Knowledge Representation (KR). Born out of this marriage is the definition of "Dempster-Shafer Belief Bases", abstract data types representing uncertain knowledge that use…

Artificial Intelligence · Computer Science 2013-04-05 Alessandro Saffiotti

We introduce a logical framework for reasoning about "uncertain interpretations" and investigate two key applications: a new semantics for implication capturing a kind of "meaning entailment", and a conservative notion of "evidentially…

Logic in Computer Science · Computer Science 2025-03-21 Adam Bjorndahl

The categorial approach to evidential reasoning can be seen as a combination of the probability kinematics approach of Richard Jeffrey (1965) and the maximum (cross-) entropy inference approach of E. T. Jaynes (1957). As a consequence of…

Artificial Intelligence · Computer Science 2013-03-26 Robert Kennes

Stemming from de Finetti's work on finitely additive coherent probabilities, the paradigm of coherence has been applied to many uncertainty calculi in order to remove structural restrictions on the domain of the assessment. Three possible…

Probability · Mathematics 2021-06-30 Davide Petturiti , Barbara Vantaggi

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

This paper suggests a new interpretation of the Dempster-Shafer theory in terms of probabilistic interpretation of plausibility. A new rule of combination of independent evidence is shown and its preservation of interpretation is…

Artificial Intelligence · Computer Science 2017-04-07 Mieczysław Kłopotek

A random set is a generalisation of a random variable, i.e. a set-valued random variable. The random set theory allows a unification of other uncertainty descriptions such as interval variable, mass belief function in Dempster-Shafer theory…

Numerical Analysis · Mathematics 2018-11-27 Truong-Vinh Hoang , Hermann G. Matthies

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

To develop an approach to utilizing continuous statistical information within the Dempster- Shafer framework, we combine methods proposed by Strat and by Shafero We first derive continuous possibility and mass functions from…

Artificial Intelligence · Computer Science 2013-04-12 Pascal Fua

One of the most important aspects in any treatment of uncertain information is the rule of combination for updating the degrees of uncertainty. The theory of belief functions uses the Dempster rule to combine two belief functions defined by…

Artificial Intelligence · Computer Science 2013-04-05 Michael S. K. M. Wong , P. Lingras

In this paper a new mathematical procedure is presented for combining different pieces of evidence which are represented in the interval form to reflect our knowledge about the truth of a hypothesis. Evidences may be correlated to each…

Artificial Intelligence · Computer Science 2013-04-05 L. W. Chang , Rangasami L. Kashyap

The fundamental updating process in the transferable belief model is related to the concept of specialization and can be described by a specialization matrix. The degree of belief in the truth of a proposition is a degree of justified…

Artificial Intelligence · Computer Science 2013-03-25 Frank Klawonn , Philippe Smets

Dempster-Shafer structure is effective in classical settings for connecting set-valued hypotheses and representing structured ignorance, yet its practical use is limited by combination growth over focal sets and high conflict management. We…

Artificial Intelligence · Computer Science 2025-10-21 Qianli Zhou , Hao Luo , Lipeng Pan , Yong Deng , Eloi Bosse

When reasoning with uncertainty there are many situations where evidences are not only uncertain but their propositions may also be weakly specified in the sense that it may not be certain to which event a proposition is referring. It is…

Artificial Intelligence · Computer Science 2007-05-23 Johan Schubert

Rule based classifiers that use the presence and absence of key sub-strings to make classification decisions have a natural mechanism for quantifying the uncertainty of their precision. For a binary classifier, the key insight is to treat…

Machine Learning · Computer Science 2020-05-20 James Nutaro , Ozgur Ozmen