Comparison of Partially Ranked Lists

Eugenia Stoimenova


In this paper we introduce a measure of closeness of partial rankings based on a metric on permutations, and we analyze some of its properties. We consider two types of partial rankings: ranking the  k favorite items out of n and classification into several ordered categories.

Full Text:



Chan CH, Yan F, Kittler J, Mikolajczyk K (2015). Full Ranking as Local Descriptor for Visual Recognition: A Comparison of Distance Metrics on Sn. Pattern Recognition, 48(4), 1328–1336.

Critchlow DE (1985). Metric Methods for Analyzing Partially Ranked Data. Lecture Notes in Statistics, 34. Berlin etc.: Springer-Verlag.

Diaconis P (1988). Group Representations in Probability and Statistics. IMS Lecture Notes-Monograph Series, 11. Hayward, CA: Institute of Mathematical Statistics.

Fagin R, Kumar R, Mahdian M, Sivakumar D, Vee E (2006). Comparing Partial Rankings. SIAM J. Discrete Math., 20(3), 628–648.

Fagin R, Kumar R, Sivakumar D (2003). Comparing Top k Lists. SIAM J. Discrete Math., 17(1), 134–160.

Jurman G, Merler S, Barla A, Paoli S, Galea A, Furlanello C (2007). Algebraic Stability Indicators for Ranked Lists in Molecular Profiling . Bioinformatics, 24(2), 258–264.

Jurman G, Riccadonna S, Visintainer R, Furlanello C (2009). Canberra Distance on Ranked Lists. In KC Agrawal C Burges (ed.), In Proceedings of Advances in Ranking NIPS 09 Workshop, pp.


Marden JI (1995). Analyzing and Modeling Rank Data. Monographs on Statistics and Applied Probability. 64. London: Chapman.

Stoimenova E (2000). Rank Tests Based on Exceeding Observations. Ann. Inst. Stat. Math., 52(2), 255–266.



  • There are currently no refbacks.

@Matthias Templ (using Open Journal Systems) -- see previous editions at