Advertisement

The α-junctions: Combination operators applicable to belief functions

  • Philippe Smets
Invited Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1244)

Abstract

Derivation through axiomatic arguments of the operators that represent associative, commutative and non interactive combinations within belief function theory. The derived operators generalize the conjunction, disjunction and exclusive disjunction cases. The operators are characterized by one parameter.

Keywords

Actual World Combination Rule Belief Function Combination Operator Conjunctive Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. DUBOIS D. and PRADE H. (1986) A set theoretical view of belief functions. Int. J. Gen. Systems, 12:193–226.Google Scholar
  2. GEBHARDT J. and KRUSE R. (1993) The Context Model: An Integrating View of Vagueness and Uncertainty, Int. J. of Approximate Reasoning 9, 283–314.Google Scholar
  3. KENNES R. and SMETS Ph. (1990) Computational Aspects of the Möbius Transform. in Bonissone P.P., Henrion M., Kanal L.N. and Lemmer J.F. eds., Uncertainty in Artificial Intelligence 6. North Holland, Amsteram, 1991, 401–416.Google Scholar
  4. KENNES R. (1992) Computational aspects of the Moebius transform of a graph. IEEE-SMC, 22: 201–223.Google Scholar
  5. KLAWONN F. and SMETS Ph. (1992) The dynammic of belief in the transferable belief model and specialization-generalization matrices. in Dubois D., Wellman M.P., D'Ambrosio B. and Smets Ph. Uncertainty in AI 92. Morgan Kaufmann, San Mateo, Ca, USA, 1992, pg. 130–137.Google Scholar
  6. SHAFER G. (1976) A mathematical theory of evidence. Princeton Univ. Press. Princeton, NJ.Google Scholar
  7. SMETS Ph. (1983) Information Content of an Evidence. Int. J. Man Machine Studies, 19: 33–43.Google Scholar
  8. SMETS Ph. (1990) The combination of evidence in the transferable belief model. IEEE Pattern analysis and Machine Intelligence, 12:447–458.Google Scholar
  9. SMETS Ph. (1992) The concept of distinct evidence. IPMU 92 Proceedings.pg. 789–794.Google Scholar
  10. SMETS Ph. (1993a) Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem. Int. J. Approximate Reasoning 9:1–35.Google Scholar
  11. SMETS Ph. (1993b) An axiomatic justifiaction for the use of belief function to quantify beliefs. IJCAI'93 (Inter. Joint Conf. on AI), Chambery. pg. 598–603.Google Scholar
  12. SMETS Ph. (1997) Imperfect information: imprecision — uncertainty. In Motro A. and Smets Ph. eds.Uncertainty Management in Information Systems. Kluwer, Boston, pg. 225–254.Google Scholar
  13. SMETS Ph. and KENNES R. (1994) The transferable belief model. Artificial Intelligence 66:191–234.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Philippe Smets
    • 1
  1. 1.IRIDIAUniversité Libre de BruxellesBelgium

Personalised recommendations