Results 1  10
of
650,795
Combination of evidence in DempsterShafer theory
, 2002
"... DempsterShafer theory offers an alternative to traditional probabilistic theory for the mathematical representation of uncertainty. The significant innovation of this framework is that it allows for the allocation of a probability mass to sets or intervals. DempsterShafer theory does not require a ..."
Abstract

Cited by 79 (2 self)
 Add to MetaCart
expert elicitation. An important aspect of this theory is the combination of evidence obtained from multiple sources and the modeling of conflict between them. This report surveys a number of possible combination rules for DempsterShafer structures and provides examples of the implementation
Algorithms for dempstershafer theory
 Algorithms for Uncertainty and Defeasible Reasoning
, 2000
"... The method of reasoning with uncertain information known as DempsterShafer 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] ..."
Abstract

Cited by 20 (3 self)
 Add to MetaCart
The method of reasoning with uncertain information known as DempsterShafer 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
The DempsterShafer calculus for statisticians
 International Journal of Approximate Reasoning
, 2007
"... The DempsterShafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) where p is the probability “for ” the assertion, q is the probability “against” the assertion, and r is the probability of “ ..."
Abstract

Cited by 46 (1 self)
 Add to MetaCart
The DempsterShafer (DS) theory of probabilistic reasoning is presented in terms of a semantics whereby every meaningful formal assertion is associated with a triple (p, q, r) where p is the probability “for ” the assertion, q is the probability “against” the assertion, and r is the probability
DempsterShafer Argument Schemes
"... Abstract. DempsterShafer theory, which can be regarded as a generalisation of probability theory, is a widely used formalism for reasoning with uncertain information. The application of the theory hinges on the use of a rule for combining evidence from different sources. A number of different comb ..."
Abstract
 Add to MetaCart
Abstract. DempsterShafer theory, which can be regarded as a generalisation of probability theory, is a widely used formalism for reasoning with uncertain information. The application of the theory hinges on the use of a rule for combining evidence from different sources. A number of different
Design of Trust Metrics Based on DempsterShafer Theory
"... This paper introduces a mechanism to quantify propagation of trust in an ecommerce environment. Using principles derived from DempsterShafer theory of evidence, we propose a method to propagate and quantify trust. More specifically, we answer the question: if A trusts B, and B trusts C, then with ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper introduces a mechanism to quantify propagation of trust in an ecommerce environment. Using principles derived from DempsterShafer theory of evidence, we propose a method to propagate and quantify trust. More specifically, we answer the question: if A trusts B, and B trusts C
Formalising trust as a computational concept
, 1994
"... Trust is a judgement of unquestionable utility — as humans we use it every day of our lives. However, trust has suffered from an imperfect understanding, a plethora of definitions, and informal use in the literature and in everyday life. It is common to say “I trust you, ” but what does that mean? T ..."
Abstract

Cited by 518 (5 self)
 Add to MetaCart
? This thesis provides a clarification of trust. We present a formalism for trust which provides us with a tool for precise discussion. The formalism is implementable: it can be embedded in an artificial agent, enabling the agent to make trustbased decisions. Its applicability in the domain of Distributed
A defect in DempsterShafer theory
 InProceedings of the Tenth Conference on Uncertainty in Arti cial Intelligence
, 1994
"... By analyzing the relationships among chance, weight of evidence and degree ofbelief, it is shown that the assertion \chances are special cases of belief functions " and the assertion \Dempster's rule can be used to combine belief functions based on distinct bodies of evidence " togeth ..."
Abstract

Cited by 28 (20 self)
 Add to MetaCart
; together lead to an inconsistency in DempsterShafer theory. To solve this problem, some fundamental postulates of the theory must be rejected. A new approach for uncertainty management is introduced, which shares many intuitive ideas with DS theory, while avoiding this problem. 1
ON BELIEF FUNCTIONS (Present State of DempsterShafer Theory)
"... Abstract. The present state of development of DempsterShafer theory is surveyed and its place among theories of dealing with uncertainty in AI is discussed. No knowledge of the theory is assumed. 1 ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. The present state of development of DempsterShafer theory is surveyed and its place among theories of dealing with uncertainty in AI is discussed. No knowledge of the theory is assumed. 1
Prioritizing Intrusion Analysis Using DempsterShafer Theory
"... Intrusion analysis and incident management remains a difficult problem in practical network security defense. The root cause of this problem is the large rate of false positives in the sensors used by Intrusion Detection System (IDS) systems, reducing the value of the alerts to an administrator. Sta ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
. Standard Bayesian theory has not been effective in this regard because of the lack of good prior knowledge. This paper presents an approach to handling such uncertainty without the need for prior information, through the DempsterShafer (DS) theory. We address a number of practical but fundamental issues
Results 1  10
of
650,795