نتایج جستجو برای: shafer equations finally
تعداد نتایج: 634776 فیلتر نتایج به سال:
Image understanding applications are often tainted with a high degree of complexity, uncertainty, and imprecision. The large amount of data makes it necessary to select the most useful information. The active fusion system proposed in this paper is able to eeectively select information sources, to control the acquisition process, to select processing strategies, to integrate results, and to dra...
This paper deals with the use of Bayesian networks to compute system reliability. The reliability analysis problem is described and the usual methods for quantitative reliability analysis are presented within a case study. Some drawbacks that justify the use of Bayesian networks are identified. The basic concepts of the Bayesian networks application to reliability analysis are introduced and a ...
The objective of this paper is to describe the potential oered by the Dempster±Shafer theory (DST) of evidence as a promising improvement on ``traditional'' approaches to decision analysis. Dempster±Shafer techniques originated in the work of Dempster on the use of probabilities with upper and lower bounds. They have subsequently been popularised in the literature on Arti®cial Intelligence (AI...
This paper presents a summary of Peter Walley’s theory of coherent lower previsions. We introduce three representations of coherent assessments: coherent lower and upper previsions, closed and convex sets of linear previsions, and sets of desirable gambles. We show also how the notion of coherence can be used to update our beliefs with new information, and a number of possibilities to model the...
We formulate the Dempster-Shafer formalism of belief functions [Shafer 761 in the spirit of logical inference systems. Our formulation (called the belief calculus) explicitly avoids the use of set-theoretic notations. As such, it serves as an alternative for the use of the Dempster-Shafer formalism for uncertain reasoning.
Automated discovery of Rule is, due to its applicability, one of the most fundamental and important method in KDD. It has been an active research area in the recent past. Hierarchical representation allows us to easily manage the complexity of knowledge, to view the knowledge at different levels of details, and to focus our attention on the interesting aspects only. One of such efficient and ea...
The goal of this paper is to study the connection between Dempster-Shafer theory and probabilistic argumentation systems. By introducing a general method to translate probabilistic argumentation systems into corresponding Dempster-Shafer belief potentials, its contribution is twofold. On the one hand, the paper proposes probabilistic argumentation systems as a convenient and powerful modeling l...
Although UNIX is considered a very stable and secure platform, the development of Intrusion Detection Systems (IDS) is essential as current and future generations of hackers are continuously attempting to undermine its integrity. The empirical experiment of multiple simultaneous threat detection system proved that use of hybrid data fusion model of Bayesian, Dempster Shafer and extended Dempste...
Dempster-Shafer (DS) theory is formulated in terms of propositional logic, using the implicit notion of provability underlying DS theory. Dempster-Shafer theory can be modeled in terms of propositional logic by the tuple (~, p), where S is a set of propositional clauses and p is an assignment of mass to each clause Ei c ~. It is shown that the disjunction of minimal support clauses for a clause...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید