The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
A similarity measure for indefinite rankings
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Art of Computer Programming
Knuth, D. E. (1968) · Cited by 16,337
Cumulated gain-based evaluation of IR techniques
Järvelin, K., & Kekäläinen, J. (2002) · ACM Transactions on Information Systems · doi:10.1145/582415.582418 · Cited by 4,841
The Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Bevan, J. M., & Kendall, M. G. (1971) · The Statistician · doi:10.2307/2986801 · Cited by 2,436
Nonparametric Statistical Inference
(2012) · SpringerReference · doi:10.1007/springerreference_205502 · Cited by 2,386
Measures of Association for Cross Classifications
Goodman, L. A., & Kruskal, W. H. (1979) · Springer Series in Statistics · doi:10.1007/978-1-4612-9995-0 · Cited by 2,244
A study of smoothing methods for language models applied to information retrieval
Zhai, C., & Lafferty, J. (2004) · ACM Transactions on Information Systems · doi:10.1145/984321.984322 · Cited by 1,201
(2003) · doi:10.5555/644108.644113 · Cited by 762
Measures of Association for Cross Classifications*
Goodman, L. A., & Kruskal, W. H. (1954) · Journal of the American Statistical Association · doi:10.1080/01621459.1954.10501231 · Cited by 678
Rank-biased precision for measurement of retrieval effectiveness
Moffat, A., & Zobel, J. (2008) · ACM Transactions on Information Systems · doi:10.1145/1416950.1416952 · Cited by 620
Self-citationOrdinal Methods for Behavioral Data Analysis
Cliff, N. (2014) · Psychology Press eBooks · doi:10.4324/9781315806730 · Cited by 560
Fagin, R., Kumar, R., & Sivakumar, D. (2003) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480102412856 · Cited by 552
Vasconcelos, W. V. (1998) · Algorithms and Computation in Mathematics · doi:10.1007/978-3-642-58951-5_2 · Cited by 404
A new rank correlation coefficient for information retrieval
Yilmaz, E., Aslam, J. A., & Robertson, S. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390435 · Cited by 260
A Measure of Top – Down Correlation
Iman, R. L., & Conover, W. J. (1987) · Technometrics · doi:10.1080/00401706.1987.10488244 · Cited by 166
Methods for comparing rankings of search engine results
Bar‐Ilan, J., Mat‐Hassan, M., & Mark Levene, A. (2005) · Computer Networks · doi:10.1016/j.comnet.2005.10.020 · Cited by 149
On rank correlation and the distance between rankings
Carterette, B. (2009) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/1571941.1572017 · Cited by 98
Methods for ranking information retrieval systems without relevance judgments
Wu, S., & Crestani, F. (2003) · ACM Symposium on Applied Computing · doi:10.1145/952532.952693 · Cited by 83
Comparing rankings of search results on the Web
Bar‐Ilan, J. (2005) · Information Processing & Management · doi:10.1016/j.ipm.2005.03.008 · Cited by 68
On rank correlation in information retrieval evaluation
Melucci, M. (2007) · ACM SIGIR Forum · doi:10.1145/1273221.1273223 · Cited by 52
Space-Limited Ranked Query Evaluation Using Adaptive Pruning
Lester, N., Moffat, A., Webber, W., & Zobel, J. (2005) · Lecture notes in computer science · doi:10.1007/11581062_37 · Cited by 38
Self-citationWeighted Rank Correlation in Information Retrieval Evaluation
Melucci, M. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04769-5_7 · Cited by 15
Cited by
A deep learning system for differential diagnosis of skin diseases
Liu, Y., Jain, A., Eng, C., Way, D. H., Lee, K., Bui, P., Kanada, K., de Oliveira Marinho, G., Gallegos, J., Gabriele, S., et al. (2020) · Nature Medicine · doi:10.1038/s41591-020-0842-3 · Cited by 853
Topic modeling algorithms and applications: A survey
Abdelrazek, A., Eid, Y., Gawish, E., Medhat, W., & Hassan, A. (2023) · Information Systems · doi:10.1016/j.is.2022.102131 · Cited by 304
Rieder, B., Matamoros-Fernández, A., & Coromina, Ò. (2018) · Convergence: The International Journal of Research into New Media Technologies · doi:10.1177/1354856517736982 · Cited by 285
Dissecting diagnostic heterogeneity in depression by integrating neuroimaging and genetics
Buch, A. M., & Liston, C. (2021) · Neuropsychopharmacology · doi:10.1038/s41386-020-00789-3 · Cited by 274
Pre-training is a Hot Topic: Contextualized Document Embeddings Improve Topic Coherence
Bianchi, F., Terragni, S., & Hovy, D. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 2: Short Papers) · doi:10.18653/v1/2021.acl-short.96 · Cited by 269
Metadata
- Authors
- Webber, W., Moffat, A., & Zobel, J.
- Venue
- ACM Transactions on Information Systems
- Published
- 2010-11
- Volume
- 28
- Issue
- 4
- Pages
- 1-38
- ISSN
- 1046-8188 (ISSN-L)
- 1558-2868
- OpenAlex
- W2021581601
- Cited by
- 781
- References
- 22
- FWCI
- 18.07
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.