Generalized distances between rankings
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
Spearman's footrule and Kendall's tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set in information retrieval: element relevance and positional information. That is, changing the rank of a highly-relevant document should result in a higher penalty than changing the rank of an irrelevant document; a similar logic holds for the top versus the bottom of the result ordering. In this work, we extend both of these metrics to those with position and element weights, and show that a variant of the Diaconis-Graham inequality still holds - the generalized two measures remain within a constant factor of each other for all permutations.
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 proof and measurement of association between two things
Spearman, C. (1904) · The American Journal of Psychology · doi:10.2307/1412159 · Cited by 8,039
A NEW MEASURE OF RANK CORRELATION
KENDALL, M. G. (1938) · Biometrika · doi:10.1093/biomet/30.1-2.81 · Cited by 7,269
Rank aggregation methods for the Web
Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.372165 · Cited by 1,793
Self-citationThe proof and measurement of association between two things
Spearman, C. (2010) · International Journal of Epidemiology · doi:10.1093/ije/dyq191 · Cited by 1,681
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
The proof and measurement of association between two things. By C. Spearman, 1904.
Spearman, C. (1987) · PubMed · Cited by 1,023
Agrawal, R., Gollapudi, S., Halverson, A., & Ieong, S. (2009) · Proceedings of the Second ACM International Conference on Web Search and Data Mining · doi:10.1145/1498759.1498766 · Cited by 1,020
IR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345545 · Cited by 967
An experimental comparison of click position-bias models
Craswell, N., Zoeter, O., Taylor, M., & Ramsey, B. (2008) · Proceedings of the international conference on Web search and web data mining - WSDM '08 · doi:10.1145/1341531.1341545 · Cited by 942
Expected reciprocal rank for graded relevance
Chapelle, O., Metlzer, D., Zhang, Y., & Grinspan, P. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646033 · Cited by 832
(2003) · doi:10.5555/644108.644113 · Cited by 762
Self-citationRetrieval evaluation with incomplete information
Buckley, C., & Voorhees, E. M. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009000 · Cited by 736
Spearman's Footrule as a Measure of Disarray
Diaconis, P., & Graham, R. L. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01624.x · Cited by 640
Aggregating inconsistent information
Ailon, N., Charikar, M., & Newman, A. (2008) · Journal of the ACM · doi:10.1145/1411509.1411513 · Cited by 630
Efficient similarity search and classification via rank aggregation
Fagin, R., Kumar, R., & Sivakumar, D. (2003) · Proceedings of the 2003 ACM SIGMOD international conference on Management of data · doi:10.1145/872757.872795 · Cited by 362
Self-citationA 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
Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2006) · SIAM Journal on Discrete Mathematics · doi:10.1137/05063088x · Cited by 155
Self-citationRank Aggregation for Similar Items
Sculley, D. (2007) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972771.66 · Cited by 107
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
RANK TESTS FOR INDEPENDENCE — WITH A WEIGHTED CONTAMINATION ALTERNATIVE
Shieh, G. S., & Bai, Z. (2000) · National University of Singapore · Cited by 27
Automatic retrieval of similar content using search engine query interface
Dasdan, A., D’Alberto, P., Kolay, S., & Drome, C. (2009) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/1645953.1646043 · Cited by 23
Cited by
Benchmarking Neural Network Robustness to Common Corruptions and Perturbations
Hendrycks, D., & Dietterich, T. (2019) · arXiv · doi:10.48550/arxiv.1903.12261 · Cited by 1,335
Deep reservoir computing: A critical experimental analysis
Gallicchio, C., Micheli, A., & Pedrelli, L. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.12.089 · Cited by 519
Measuring price discrimination and steering on e-commerce web sites
Hannak, A., Soeller, G., Lazer, D., Mislove, A., & Wilson, C. (2014) · Proceedings of the 2014 Conference on Internet Measurement Conference · doi:10.1145/2663716.2663744 · Cited by 405
Metadata
- Authors
- Kumar, R., & Vassilvitskii, S.
- Venue
- Proceedings of the 19th international conference on World wide web
- Publisher
- ACM
- Published
- 2010-04-26
- Pages
- 571-580
- OpenAlex
- W2160266360
- Cited by
- 273
- References
- 21
- FWCI
- 12.82
- Type
- conference paper
- 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.