中文
相关论文

相关论文: Specifying nonspecific evidence

200 篇论文

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…

人工智能 · 计算机科学 2007-05-23 Johan Schubert

This article is an extension of the results of two earlier articles. In [J. Schubert, On nonspecific evidence, Int. J. Intell. Syst. 8 (1993) 711-725] we established within Dempster-Shafer theory a criterion function called the metaconflict…

人工智能 · 计算机科学 2007-05-23 Johan Schubert

When simultaneously reasoning with evidences about several different events it is necessary to separate the evidence according to event. These events should then be handled independently. However, when propositions of evidences are weakly…

人工智能 · 计算机科学 2007-05-23 Johan Schubert

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…

人工智能 · 计算机科学 2013-04-05 L. W. Chang , Rangasami L. Kashyap

One problem to solve in the context of information fusion, decision-making, and other artificial intelligence challenges is to compute justified beliefs based on evidence. In real-life examples, this evidence may be inconsistent,…

人工智能 · 计算机科学 2023-06-07 Daira Pinto Prieto , Ronald de Haan , Aybüke Özgün

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…

人工智能 · 计算机科学 2013-02-28 Pei Wang

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…

人工智能 · 计算机科学 2017-06-09 Andrzej Matuszewski , Mieczysław A. Kłopotek

We develop a classification method for incoming pieces of evidence in Dempster-Shafer theory. This methodology is based on previous work with clustering and specification of originally nonspecific evidence. This methodology is here put in…

人工智能 · 计算机科学 2007-05-23 Johan Schubert

Evidential reasoning in expert systems has often used ad-hoc uncertainty calculi. Although it is generally accepted that probability theory provides a firm theoretical foundation, researchers have found some problems with its use as a…

人工智能 · 计算机科学 2013-04-15 Robert Fung , Chee Yee Chong

The computational complexity of reasoning within the Dempster-Shafer theory of evidence is one of the main points of criticism this formalism has to face. To overcome this difficulty various approximation algorithms have been suggested that…

人工智能 · 计算机科学 2013-02-18 Mathias Bauer

Dempster/Shafer (D/S) theory has been advocated as a way of representing incompleteness of evidence in a system's knowledge base. Methods now exist for propagating beliefs through chains of inference. This paper discusses how rules with…

人工智能 · 计算机科学 2013-04-10 Paul K. Black , Kathryn Blackmond Laskey

In this paper we extend an earlier result within Dempster-Shafer theory ["Fast Dempster-Shafer Clustering Using a Neural Network Structure," in Proc. Seventh Int. Conf. Information Processing and Management of Uncertainty in Knowledge-Based…

人工智能 · 计算机科学 2016-11-15 Johan Schubert

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…

人工智能 · 计算机科学 2019-06-28 Fuyuan Xiao

This paper presents a new classifier combination technique based on the Dempster-Shafer theory of evidence. The Dempster-Shafer theory of evidence is a powerful method for combining measures of evidence from different classifiers. However,…

人工智能 · 计算机科学 2011-07-04 A. Al-Ani , M. Deriche

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…

概率论 · 数学 2017-02-02 Timber Kerkvliet , Ronald Meester

The paper presents a novel view of the Dempster-Shafer belief function as a measure of diversity in relational data bases. It is demonstrated that under the interpretation The Dempster rule of evidence combination corresponds to the join…

人工智能 · 计算机科学 2017-04-11 Mieczysław A. Kłopotek , Sławomir T. Wierzchoń

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…

人工智能 · 计算机科学 2013-03-26 Robert Kennes

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…

人工智能 · 计算机科学 2013-04-05 Mary McLeish

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…

人工智能 · 计算机科学 2013-04-05 Nic Wilson

Dempster-Shafer evidence theory is a powerful tool in information fusion. When the evidence are highly conflicting, the counter-intuitive results will be presented. To adress this open issue, a new method based on evidence distance of…

人工智能 · 计算机科学 2014-04-21 Hongming Mo , Yong Deng
‹ 上一页 1 2 3 10 下一页 ›