The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Rank aggregation methods for the Web
Abstract
We consider the problem of combining ranking results from various sources. In the context of the Web, the main applications include building meta-search engines, combining ranking functions, selecting documents based on multiple criteria, and improving search precision through word associations. We develop a set of techniques for the rank aggregation problem and compare their performance to that of well-known methods. A primary goal of our work is to design rank aggregation techniques that can e ectively combat \\spam, " a serious problem in Web searches. Experiments show that our methods are simple, e cient, and e ective.
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 anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1999) · Journal of the ACM · doi:10.1145/324133.324140 · Cited by 8,959
Automatic text processing: the transformation, analysis, and retrieval of information by computer
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0351 · Cited by 3,188
Mémoire sur les élections au scrutin
Daunou, P. C. F. (1803) · Medical Entomology and Zoology · Cited by 824
Young, H. P. (1988) · American Political Science Review · doi:10.2307/1961757 · Cited by 746
Improved Algorithms for Topic Distillation in a Hyperlinked Environment
Bharat, K., & Henzinger, M. R. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130367 · Cited by 676
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
Voting schemes for which it can be difficult to tell who won the election
Bartholdi, J., Tovey, C. A., & Trick, M. A. (1989) · Social Choice and Welfare · doi:10.1007/bf00303169 · Cited by 548
Analyzing and Modeling Rank Data
Groggel, D. J. (1996) · Technometrics · doi:10.1080/00401706.1996.10484555 · Cited by 521
Aggregation of Preferences with Variable Electorate
Smith, J. H. (1973) · Econometrica · doi:10.2307/1914033 · Cited by 494
A Consistent Extension of Condorcet’s Election Principle
Young, H. P., & Levenglick, A. (1978) · SIAM Journal on Applied Mathematics · doi:10.1137/0135023 · Cited by 455
Improved algorithms for topic distillation in a hyperlinked environment
Bharat, K., & Henzinger, M. R. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290972 · Cited by 444
Metric Methods for Analyzing Partially Ranked Data
Singh, A. K., & Critchlow, D. E. (1987) · Technometrics · doi:10.2307/1269357 · Cited by 199
Cited by
Improving recommendation lists through topic diversification
Ziegler, C.-N., McNee, S. M., Konstan, J. A., & Lausen, G. (2005) · Proceedings of the 14th international conference on World Wide Web - WWW '05 · doi:10.1145/1060745.1060754 · Cited by 1,892
Haveliwala, T. H. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511513 · Cited by 1,567
Robust rank aggregation for gene list integration and meta-analysis
Kolde, R., Laur, S., Adler, P., & Vilo, J. (2012) · Bioinformatics · doi:10.1093/bioinformatics/btr709 · Cited by 1,191
Foundations of Machine Learning
Mohri, M., Rostamizadeh, A., & Talwalkar, A. (2018) · doi:10.7551/mitpress/10290.001.0001 · Cited by 1,122
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
Metadata
- Authors
- Dwork, C., Kumar, R., Naor, M., & Sivakumar, D.
- Venue
- Proceedings of the 10th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2001-04
- Pages
- 613-622
- OpenAlex
- W2051834357
- Cited by
- 1,793
- References
- 13
- FWCI
- 24.38
- 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.