نتایج جستجو برای: shafer reasoning

تعداد نتایج: 81958  

2005
Jean Dezert Florentin Smarandache

This paper introduces the recent theory of plausible and paradoxical reasoning, known as DSmT (Dezert-Smarandache Theory) in the literature, which deals with imprecise, uncertain and potentially highly conflicting sources of information. Recent publications have shown the interest and the potential ability of DSmT to solve fusion problems where Dempster-Shafer Theory (DST) provides counter-intu...

1996
Mathias Bauer

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 aim at reducing the number of focal elements in the belief functions involved. Besides introducing a new algorithm using this method, this paper describes a...

1997
LUIS MATEUS ROCHA

Zadeh’s Fuzzy Sets are extended with the Dempster-Shafer Theory of Evidence into a new mathematical structure called Evidence Sets, which can capture more efficiently all recognized forms of uncertainty in a formalism that explicitly models the subjective context dependencies of linguistic categories. A belief-based theory of Approximate Reasoning is proposed for these structures. Evidence sets...

2017
Tom Williams Matthias Scheutz

Robots designed to interact with humans in realistic environments must be able to handle uncertainty with respect to the identities and properties of the people, places, and things found in their environments. When humans refer to these entities using under-specified language, robots must often generate clarification requests to determine which entities were meant. In this paper, we present rec...

1996
Andrew Howard Les Kitchen

We address the problem of building environment maps from ultrasonic range data obtained from multiple viewpoints. We present a novel environment modelling technique called the `response grid' that allows us to build occupancy maps in highly specular environments. We present three di erent approaches that utilise this technique: a Bayesian probabilisitic approach, a Dempster-Shafer evidential re...

Journal: :International journal of fuzzy system applications 2021

The study of coverage problem in uncertain WSN environment requires the consideration this uncertainty by taking best possible decisions, since it is impossible to explicitly represent all combinatorics produce a conditional active/passive state nodes' planning area interest, and allow reasoning on various environmental states partially known physical world. This paper addresses based Dempster-...

2017
Branko Malešević Marija Rašajski Tatjana Lutovac

In this paper, we give some sharper refinements and generalizations of inequalities related to Shafer-Fink's inequality for the inverse sine function stated in Theorems 1, 2, and 3 of Bercu (Math. Probl. Eng. 2017: Article ID 9237932, 2017).

Journal: :IEEE Trans. Knowl. Data Eng. 1997
Jiming Liu Michel C. Desmarais

This paper describes an algorithmic means for inducing implication networks from empirical data samples. The induced network enables efficient inferences about the values of network nodes if certain observations are made. This implication induction method is approximate in nature as probablistic network requirements are relaxed in the construction of dependence relationships based on statistica...

2005
John W. Sheppard

Recent attention to using “case-based” reasoning for intelligent fault diagnosis has led to the development of very large, complex databases of diagnostic cases. The performance of case-based reasoners is dependent upon the size of the case base such that as case bases increase in size, it is usually reasonable to expect accuracy to improve but computational performance to degrade. Given one of...

1991
J. Kohlas P. A. Monney L. Cardona

In this paper, the well known mathematical theory of evidence (Shafer, 1976) will be considered from a point of view which is di erent from usual. Simple belief functions (hints) will be regarded as arguments which are not fully reliable (Kohlas, 1989). This implies that the construction of argumentation chains for a particular hypothesis will have limited reliability. Since there are usually m...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید