%0 Journal Article %1 webber2010similarity %A Webber, William %A Moffat, Alistair %A Zobel, Justin %C New York, NY, USA %D 2010 %I ACM %J Transactions on Information Systems %K %N 4 %P 20:1--20:38 %R 10.1145/1852102.1852106 %T A Similarity Measure for Indefinite Rankings %U http://doi.acm.org/10.1145/1852102.1852106 %V 28 %X Ranked lists are encountered in research and daily life and it is often of interest to compare these lists even when they are incomplete or have only some members in common. An example is document rankings returned for the same query by different search engines. A measure of the similarity between incomplete rankings should handle nonconjointness, weight high ranks more heavily than low, and be monotonic with increasing depth of evaluation; but no measure satisfying all these criteria currently exists. In this article, we propose a new measure having these qualities, namely rank-biased overlap (RBO). The RBO measure is based on a simple probabilistic user model. It provides monotonicity by calculating, at a given depth of evaluation, a base score that is non-decreasing with additional evaluation, and a maximum score that is nonincreasing. An extrapolated score can be calculated between these bounds if a point estimate is required. RBO has a parameter which determines the strength of the weighting to top ranks. We extend RBO to handle tied ranks and rankings of different lengths. Finally, we give examples of the use of the measure in comparing the results produced by public search engines and in assessing retrieval systems in the laboratory.

@article{webber2010similarity, abstract = {Ranked lists are encountered in research and daily life and it is often of interest to compare these lists even when they are incomplete or have only some members in common. An example is document rankings returned for the same query by different search engines. A measure of the similarity between incomplete rankings should handle nonconjointness, weight high ranks more heavily than low, and be monotonic with increasing depth of evaluation; but no measure satisfying all these criteria currently exists. In this article, we propose a new measure having these qualities, namely rank-biased overlap (RBO). The RBO measure is based on a simple probabilistic user model. It provides monotonicity by calculating, at a given depth of evaluation, a base score that is non-decreasing with additional evaluation, and a maximum score that is nonincreasing. An extrapolated score can be calculated between these bounds if a point estimate is required. RBO has a parameter which determines the strength of the weighting to top ranks. We extend RBO to handle tied ranks and rankings of different lengths. Finally, we give examples of the use of the measure in comparing the results produced by public search engines and in assessing retrieval systems in the laboratory.}, acmid = {1852106}, added-at = {2015-07-29T09:50:48.000+0200}, address = {New York, NY, USA}, articleno = {20}, author = {Webber, William and Moffat, Alistair and Zobel, Justin}, biburl = {https://www.bibsonomy.org/bibtex/2f8092a44c924714e112111784a71ab3e/jaeschke}, doi = {10.1145/1852102.1852106}, interhash = {91b8c9c5d702ac7d90668baed34cfbac}, intrahash = {f8092a44c924714e112111784a71ab3e}, issn = {1046-8188}, issue_date = {November 2010}, journal = {Transactions on Information Systems}, keywords = {}, month = nov, number = 4, numpages = {38}, pages = {20:1--20:38}, publisher = {ACM}, timestamp = {2015-07-29T09:50:48.000+0200}, title = {A Similarity Measure for Indefinite Rankings}, url = {http://doi.acm.org/10.1145/1852102.1852106}, volume = 28, year = 2010 }