The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Comparing Top k Lists
Abstract
Motivated by several applications, we introduce various distance measures between "top k lists." Some of these distance measures are metrics, while others are not. For each of these latter distance measures, we show that they are "almost" a metric in the following two seemingly unrelated aspects: (i) they satisfy a relaxed version of the polygonal (hence, triangle) inequality, and (ii) there is a metric with positive constant multiples that bound our measure above and below. This is not a coincidence---we show that these two notions of almost being a metric are the same. Based on the second notion, we define two distance measures to be equivalent if they are bounded above and below by constant multiples of each other. We thereby identify a large and robust equivalence class of distance measures. Besides the applications to the task of identifying good notions of (dis)similarity between two top k lists, our results imply polynomial-time constant-factor approximation algorithms for the rank aggregation problem with respect to a large class of distance measures. (A correction for this article has been appended to the pdf file.)
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Moran, P. A. P., & Kendall, M. G. (1973) · International Statistical Review / Revue Internationale de Statistique · doi:10.2307/1402637 · Cited by 4,054
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
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
Metric Methods for Analyzing Partially Ranked Data
Critchlow, D. E. (1985) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-1106-8 · Cited by 166
Relaxing the Triangle Inequality in Pattern Matching
Fagin, R., & Stockmeyer, L. J. (1998) · International Journal of Computer Vision · doi:10.1023/a:1008023416823 · Cited by 95
Self-citationPerformance Guarantees for Approximation Algorithms Depending on Parametrized Triangle Inequalities
Andreae, T., & Bandelt, H. (1995) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480192240226 · Cited by 84
Performance guarantees for the TSP with a parameterized triangle inequality
Bender, M. A., & Chekuri, C. (2000) · Information Processing Letters · doi:10.1016/s0020-0190(99)00160-x · Cited by 70
Cited by
Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search
Haveliwala, T. H. (2003) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2003.1208999 · Cited by 1,052
A similarity measure for indefinite rankings
Webber, W., Moffat, A., & Zobel, J. (2010) · ACM Transactions on Information Systems · doi:10.1145/1852102.1852106 · Cited by 781
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
A New Coefficient of Rankings Similarity in Decision-Making Problems
Sałabun, W., & Urbaniak, K. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-50417-5_47 · Cited by 289
Quality indices for topic model selection and evaluation: a literature review and case study
Meaney, C., Stukel, T. A., Austin, P. C., Moineddin, R., Greiver, M., & Escobar, M. (2023) · BMC Medical Informatics and Decision Making · doi:10.1186/s12911-023-02216-1 · Cited by 23
Metadata
- Authors
- Fagin, R., Kumar, R., & Sivakumar, D.
- Venue
- SIAM Journal on Discrete Mathematics
- Published
- 2003-01
- Volume
- 17
- Issue
- 1
- Pages
- 134-160
- ISSN
- 0895-4801 (ISSN-L)
- 1095-7146
- OpenAlex
- W4256046779
- Cited by
- 552
- References
- 7
- FWCI
- 25.45
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Comparing Top k Lists. https://app.cochat.ai/papers/10.1137/s0895480102412856
- The paper
- Fagin, R., Kumar, R., & Sivakumar, D. (2003). Comparing Top k Lists. SIAM Journal on Discrete Mathematics. https://doi.org/10.1137/s0895480102412856
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.