All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

78 378 (0,179s)

Result

Generalization of the Classic Combination Rules to DSm Hyper-Power Sets

Dempster's rule, Yager's rule and Dubois-Prade's rule for belief functions combinations are generalized to be applicable to hyper-power sets according to the DSm theory. A comparison of the rules ...

BA - Obecná matematika

  • 2006
  • Jx
Result

Algebraic Structures Related to the Combination of Belief Functions

structure of binary belief functions with the Dempster's rule of combination is briefly of combination has increased. To compare the nature of this rule with a more frequent butalso more controversional o...

BA - Obecná matematika

  • 2004
  • Jx
Result

A Relation of Conjunctive and Disjunctive Rules of Combination on Bayesian Belief Functions

For combination of beliefs, the Dempster's (normalized conjunctive) rule of combination, its modifications and several alternatives are used in the theory of belief functions. The relation of the 2D Dempster's<...

BA - Obecná matematika

  • 2004
  • D
Result

Classical Combination Rules Generalized to DMs Hyper-Power Sets and their Comparison with the Hybrid DSm rule. Chapter 3

Dempster's rule, non-normalized conjunctive rule, Yager's rule and Dubois-Prade's rule for belief functions combination are generalized to be applicable to hyper-power sets according to the DSm th...

BA - Obecná matematika

  • 2006
  • C
Result

There are combinations and compositions in Dempster-Shafer theory of evidence

Dempster´s rule of combination is compared with the so called operator of composition, which is in theory of compositional models used for multidimensional model construction. Second part of the paper is devoted to a new wa...

IN - Informatika

  • 2009
  • D
Result

Algebraic Structures Related to Combination of Belief Functions.

with disjunctive rule of combination is defined. The structure is studied and compared with Dempster semigroup - the algebraic structure based on classical Dempster ruleBased on a new demand - commutativi...

BA - Obecná matematika

  • 2002
  • D
Result

Algebraic Structures Related to the Consensus Operator for Combining Beliefs.

To overcome the frequent criticism of Dempster's rule for combination of belief functions several alternatives were defined, the consensus operator among them introduced byHájek-Valdés for Dempster's semigroup. The...

BA - Obecná matematika

  • 2003
  • D
Result

Dempster Combination Rule with Boolean-Like Processed Belief Functions.

For a large enough class of probability measures, Dempster combination rule for belief functions can be obtained without the assumption of statistical independence of input empirical data charged with uncertainty....

BA - Obecná matematika

  • 2001
  • Jx
Result

A Nonstandard Modification of Dempster Combination Rule.

For a particular but large enough class of probability measures, an analogy of Dempster combination rule, preserving its extensional character but using some nonstandard and boolean-like structures over the unit interval of...

BA - Obecná matematika

  • 2002
  • Jx
Result

Comparison between DSm and MinC Combination Rules. Chapter 10

, an alternative tothe Dempster's rule of combination, follows. Working domains, structures and mechanisms of the DSm and minC combination rules are compared in the body of this chapterBoth DSm and minC

BA - Obecná matematika

  • 2004
  • C
  • 1 - 10 out of 78 378