Skip to main content

Ranking Aggregation Based on Belief Function

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 299))

Abstract

In this work we consider the case of the ranking aggregation problem that includes the true ranking in its formulation. The goal is to find an estimation of an unknown true ranking given a set of rankings provided by different quality experts. This is the case when bioinformatic experts provide ranked items involved in an unknown biological phenomenon regulated by its own physical reality. We devise an innovative solution called Belief Ranking Estimator (BRE), based on the belief function framework that permits to represent beliefs on the correctness of each item rank as well as uncertainty on the quality of the rankings from the subjective point of view of the expert. Moreover, weights computed using a true-ranking estimator are applied to the original belief basic assignment in order to take into account the quality of the input rankings. The results of an empirical comparison of BRE with weighting schema against competitor methods for ranking aggregation show that our method improves significantly the performance when the quality of the ranking is heterogeneous.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adali, S., Hill, B., Magdon-Ismail, M.: The Impact of Ranker Quality on Rank Aggregation Algorithms: Information vs. Robustness. In: Proceedings of the 22nd International Conference on Data Engineering, pp. 37–37 (2006)

    Google Scholar 

  2. Argentini, A., Blanzieri, E.: Unsupervised Learning of True Ranking Estimators using the Belief Function Framework. Technical Report DISI-11-480 (2011)

    Google Scholar 

  3. Borda, J.C.: Mémoire sur les Élections au Scrutin. Histoire de l’ Académie Royale des Sciences (1781)

    Google Scholar 

  4. Dempster, A.P.: Upper and Lower Probabilities Generated by a Random Closed Intervals. The Annals of Mathematical Statistics 39, 957–966 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  5. Diaconis, P., Graham, R.L.: Spearman’s Footrule as a Measure of Disarray. Journal of the Royal Statistical Society. Series B (Methodological) 30(2), 262–268 (1979)

    MathSciNet  Google Scholar 

  6. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank Aggregation Methods for the Web. In: Proceedings of the 10th WWW Conference, pp. 613–622 (2001)

    Google Scholar 

  7. Kendall, M.G.: Rank Correlation Methods. Griffin (1948)

    Google Scholar 

  8. Masson, M., Denoeux, T.: Clustering Interval-Valued Proximity Data Using Belief Functions. Pattern Recogn. Lett. 25 (January 2004)

    Google Scholar 

  9. Pihur, V., Datta, S., Datta, S.: Weighted Rank Rggregation of Cluster Validation Measures: a Monte Carlo Cross-Entropy Approach. Bioinformatics 23(13), 1607–1615 (2007)

    Article  Google Scholar 

  10. Shafer, G.: A Mathematical Theory of Evidence, vol. 1. Princeton University Press, Princeton (1976)

    MATH  Google Scholar 

  11. Smets, P., Kennes, R.: The Transferable Belief Model. Artificial Intelligence 66(2), 191–234 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  12. Yager, R.: Decision Making Under Dempster-Shafer Uncertainties. International Journal of General System 20(3), 233–245 (1992)

    Article  MATH  Google Scholar 

  13. Younes, Z., Abdallah, F., Denœux, T.: An Evidence-Theoretic K-Nearest Neighbor Rule for Multi-Label Classification. Scalable Uncertainty Management, 297–308 (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Argentini, A., Blanzieri, E. (2012). Ranking Aggregation Based on Belief Function. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds) Advances in Computational Intelligence. IPMU 2012. Communications in Computer and Information Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31718-7_53

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31718-7_53

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics