Skip to main content

Ranking from Pairwise Comparisons in the Belief Functions Framework

  • Conference paper
Belief Functions: Theory and Applications

Part of the book series: Advances in Intelligent and Soft Computing ((AINSC,volume 164))

Abstract

The problem of deriving a binary relation over alternatives based on paired comparisons is studied. The problem is tackled in the framework of belief functions, which is well-suited to model and manipulate partial and uncertain information. Starting from the work of Tritchler and Lockwood [8], the paper proposes a general model of mass allocation and combination, and shows how to practically derive a complete or a partial ranking of the alternatives. A small example is provided as an illustration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Denoeux, T.: Conjunctive and Disjunctive Combination of Belief Functions Induced by Non Distinct Bodies of Evidence. Artificial Intelligence 172, 234–264 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  2. Dubois, D., Prade, H.: On the ranking of ill-known values in possibility theory. Fuzzy sets and Systems 43, 311–317 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  4. Smets, P.: The combination of evidence in the Transferable Belief Model. IEEE Transactions on Pattern Analysis and Machine Intelligence 12(5), 447–458 (1990)

    Article  Google Scholar 

  5. Smets, P.: Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem. International Journal of Approximate Reasoning 9, 1–35 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  6. Smets, P., Kennes, R.: The Transferable Belief Model. Artificial Intelligence 66, 191–243 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. Smets, P.: The Transferable Belief Model for quantified belief representation. In: Gabbay, D.M., Smets, P. (eds.) Hanbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 267–301. Kluwer Academic Publishers, Dordrecht (1998)

    Google Scholar 

  8. Tritchler, D., Lockwood, G.: Modelling the reliability of paired comparisons. Journal of Mathematical Psychology 35, 277–293 (1991)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marie-Hélène Masson .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Masson, MH., Denœux, T. (2012). Ranking from Pairwise Comparisons in the Belief Functions Framework. In: Denoeux, T., Masson, MH. (eds) Belief Functions: Theory and Applications. Advances in Intelligent and Soft Computing, vol 164. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29461-7_36

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29461-7_36

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29460-0

  • Online ISBN: 978-3-642-29461-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics