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
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
Langville, A., & Meyer, C. (2004) · Internet Mathematics · doi:10.1080/15427951.2004.10129091 · Cited by 894
Parikh, D., & Grauman, K. (2011) · 2011 International Conference on Computer Vision · doi:10.1109/iccv.2011.6126281 · Cited by 851
A survey of top- k query processing techniques in relational database systems
Ilyas, I. F., Beskales, G., & Soliman, M. A. (2008) · ACM Computing Surveys · doi:10.1145/1391729.1391730 · Cited by 825
Gionis, A., Mannila, H., & Tsaparas, P. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217303 · Cited by 819
(2003) · doi:10.5555/644108.644113 · Cited by 762
Self-citationRandom walks and diffusion on networks
Masuda, N., Porter, M. A., & Lambiotte, R. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.07.007 · Cited by 657
A knowledge plane for the internet
Clark, D. D., Partridge, C., Ramming, J. C., & Wroclawski, J. T. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863957 · Cited by 609
Label ranking by learning pairwise preferences
Hüllermeier, E., Fürnkranz, J., Cheng, W., & Brinker, K. (2008) · Artificial Intelligence · doi:10.1016/j.artint.2008.08.002 · Cited by 536
A large-scale evaluation and analysis of personalized search strategies
Dou, Z., Song, R., & Wen, J.-R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242651 · Cited by 530
Group recommendations with rank aggregation and collaborative filtering
Baltrunas, L., Makcinskas, T., & Ricci, F. (2010) · Proceedings of the fourth ACM conference on Recommender systems · doi:10.1145/1864708.1864733 · Cited by 490
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Supporting top-k join queries in relational databases
Ilyas, I., Aref, W., & Elmagarmid, A. (2004) · The VLDB Journal · doi:10.1007/s00778-004-0128-2 · Cited by 385
A feature selection model based on genetic rank aggregation for text sentiment classification
Onan, A., & Korukoğlu, S. (2017) · Journal of Information Science · doi:10.1177/0165551515613226 · Cited by 385
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-citationAguillo, I. F., Bar-Ilan, J., Levene, M., & Ortega, J. L. (2010) · Scientometrics · doi:10.1007/s11192-010-0190-z · Cited by 344
Li, Y., Gao, J., Meng, C., Li, Q., Su, L., Zhao, B., Fan, W., & Han, J. (2016) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2897350.2897352 · Cited by 336
Statistical ranking and combinatorial Hodge theory
Jiang, X., Lim, L.-H., Yao, Y., & Ye, Y. (2011) · Mathematical Programming · doi:10.1007/s10107-010-0419-x · Cited by 335
Noncompensatory/nonlinear composite indicators for ranking countries: a defensible setting
Munda, G., & Nardo, M. (2009) · Applied Economics · doi:10.1080/00036840601019364 · Cited by 313
Stable feature selection for biomarker discovery
He, Z., & Yu, W. (2010) · Computational Biology and Chemistry · doi:10.1016/j.compbiolchem.2010.07.002 · Cited by 309
Link analysis ranking: algorithms, theory, and experiments
Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2005) · ACM Transactions on Internet Technology · doi:10.1145/1052934.1052942 · Cited by 308
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
Fogaras, D., Rácz, B., Csalogány, K., & Sarlós, T. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129104 · Cited by 282
Weblog success: Exploring the role of technology
Du, H. S., & Wagner, C. (2006) · International Journal of Human-Computer Studies · doi:10.1016/j.ijhcs.2006.04.002 · Cited by 280
Exploring folksonomy for personalized search
Xu, S., Bao, S., Fei, B., Su, Z., & Yu, Y. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390363 · Cited by 275
Generalized distances between rankings
Kumar, R., & Vassilvitskii, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772749 · Cited by 273
Self-citationUsing ODP metadata to personalize search
Chirita, P. A., Nejdl, W., Paiu, R., & Kohlschütter, C. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076067 · Cited by 271
Semantically enhanced Information Retrieval: An ontology-based approach
Fernández, M., Cantador, I., López, V., Vallet, D., Castells, P., & Motta, E. (2011) · Journal of Web Semantics · doi:10.1016/j.websem.2010.11.003 · Cited by 263
Molecular phenotyping of a UK population: defining the human serum metabolome
Dunn, W. B., Lin, W., Broadhurst, D., Begley, P., Brown, M., Zelena, E., Vaughan, A. A., Halsall, A., Harding, N., Knowles, J. D., et al. (2015) · Metabolomics · doi:10.1007/s11306-014-0707-1 · Cited by 253
Network medicine framework for identifying drug-repurposing opportunities for COVID-19
Morselli Gysi, D., do Valle, Í., Zitnik, M., Ameli, A., Gan, X., Varol, O., Ghiassian, S. D., Patten, J. J., Davey, R. A., Loscalzo, J., et al. (2021) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2025581118 · Cited by 107
“As the optimal outcome, called the Kemeny consensus (29), is NP -hard to compute, we implemented three heuristic rank aggregation algorithms that approximate the Kemeny consensus: Borda ’ s count (30), the Dowdall method (31), and CRank (16).”
MethodChoosing Aggregation Rules for Composite Indicators
Munda, G. (2012) · Social Indicators Research · doi:10.1007/s11205-011-9911-9 · Cited by 88
Upadhya, S. R., & Ryan, C. J. (2022) · Cell Reports Methods · doi:10.1016/j.crmeth.2022.100288 · Cited by 81
Dehghani, M., Tay, Y., Gritsenko, A. A., Zhao, Z., Houlsby, N., Diaz, F., Metzler, D., & Vinyals, O. (2021) · arXiv · doi:10.48550/arxiv.2107.07002 · Cited by 48
Probabilistic Graphical Models for Boosting Cardinal and Ordinal Peer Grading in MOOCs
Mi, F., & Yeung, D.-Y. (2015) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v29i1.9210 · Cited by 34
Post Classification Label Refinement Using Implicit Ordering Constraint Among Data Instances
Khandelwal, A., Mithal, V., & Kumar, V. (2015) · 2015 IEEE International Conference on Data Mining · doi:10.1109/icdm.2015.149 · Cited by 21
“Kemeny optimal aggregations satisfy extended Condercet Criterion which makes them suitable for detecting outliers or inconsistencies in partial rankings [9].”
BackgroundMethodUncertainty quantification in the Bradley–Terry–Luce model
Gao, C., Shen, Y., & Zhang, A. Y. (2023) · Information and Inference: A Journal of the IMA · doi:10.1093/imaiai/iaac032 · Cited by 71
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.