On the α-Conjunctions for Combining Belief Functions

  • Frédéric Pichon
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 164)


The α-conjunctions basically represent the set of associative, commutative and linear operators for belief functions with the vacuous belief function as neutral element. Besides, they include as particular case the unnormalized Dempster’s rule. They are thus particularly interesting from a formal standpoint. However, they suffer from a main limitation: they lack a clear interpretation in general. In this paper, an interpretation for these combination rules is proposed, based on a new framework that allows the integration of meta-knowledge on the various forms of lack of truthfulness of the information sources.


Mass Function Multivalued Mapping Combination Rule Belief Function Neutral Element 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Dempster, A.P.: Upper and lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics 38, 325–339 (1967)MathSciNetzbMATHCrossRefGoogle Scholar
  2. 2.
    Dubois, D., Prade, H.: A set-theoretic view of belief functions: logical operations and approximations by fuzzy sets. International Journal of General Systems 12(3), 193–226 (1986)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Pichon, F., Denœux, T.: Interpretation and computation of α-junctions for combining belief functions. In: Sixth Int. Symp. on Imprecise Probability: Theories and Applications (ISIPTA 2009), Durham, United Kingdom (July 2009)Google Scholar
  4. 4.
    Pichon, F., Dubois, D., Denœux, T.: Relevance and truthfulness in information correction and fusion. International Journal of Approximate Reasoning 53(2), 159–175 (2012)CrossRefGoogle Scholar
  5. 5.
    Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)zbMATHGoogle Scholar
  6. 6.
    Smets, P.: The combination of evidence in the Transferable Belief Model. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(5), 447–458 (1990)CrossRefGoogle Scholar
  7. 7.
    Smets, P.: Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem. International Journal of Approximate Reasoning 9(1), 1–35 (1993)MathSciNetzbMATHCrossRefGoogle Scholar
  8. 8.
    Smets, P.: The α-junctions: Combination Operators Applicable to Belief Functions. In: Nonnengart, A., Kruse, R., Ohlbach, H.J., Gabbay, D.M. (eds.) FAPR 1997 and ECSQARU 1997. LNCS, vol. 1244, pp. 131–153. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  9. 9.
    Smets, P.: The application of the matrix calculus to belief functions. International Journal of Approximate Reasoning 31(1-2), 1–30 (2002)MathSciNetzbMATHCrossRefGoogle Scholar
  10. 10.
    Smets, P., Kennes, R.: The Transferable Belief Model. Artif. Intell. 66, 191–243 (1994)MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Thales Research and TechnologyPalaiseau CedexFrance

Personalised recommendations