The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Rank aggregation methods
Abstract
This article provides an overview of rank aggregation methods and algorithms, with an emphasis on modern biological applications. Rank aggregation methods have traditionally been used extensively in marketing and advertisement research, and in applied psychology in general. In recent years, rank aggregation methods have emerged as an important tool for combining information from different Internet search engines or from different omics‐scale biological studies. We discuss three classes of methods, namely distributional based, heuristic, and stochastic search. The original Thurstone's scaling and its extensions represent the first class of methods that are most appropriate for aggregating many short ranked lists. Aggregating results from consumer rankings of products falls into this category of problems. Its application to biological problems is also being explored. On the other hand, heuristic algorithms and stochastic search methods are applicable to the situation of aggregating a small number of long lists, the so‐called ‘high‐level’ meta‐analysis scenario. Combining results from different search engines/criteria and a number of omics‐scale biological applications fall into this category. Heuristic algorithms are deterministic in nature, ranging from simple arithmetic averages of ranks to Markov chains and stationary distributions. Stochastic search algorithms, on the other hand, aim at maximizing a particular criterion such as that following the Kemeny guideline. Several examples will be provided to illustrate, compare, and contrast the methods and algorithms. The examples range from simple and contrive to representing realistic scenarios. In particular, an application to aggregating results from gene expression microarray studies is provided to demonstrate applications of the methods to modern biological problems. Copyright © 2010 John Wiley & Sons, Inc. This article is categorized under:Statistical and Graphical Methods of Data Analysis > Robust Methods
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
McLachlan, G., & Peel, D. (2000) · Wiley Series in Probability and Statistics · doi:10.1002/0471721182 · Cited by 10,991
(2003) · doi:10.5555/644108.644113 · Cited by 762
Accuracy and calibration of commercial oligonucleotide and custom cDNA microarrays
Yuen, T. (2002) · Nucleic Acids Research · doi:10.1093/nar/30.10.e48 · Cited by 520
Cited by
Automated Machine Learning: Methods, Systems, Challenges
(2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5 · Cited by 1,485
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
Vanschoren, J. (2019) · The Springer Series on Challenges in Machine Learning · doi:10.1007/978-3-030-05318-5_2 · Cited by 328
GTRD: an integrated view of transcription regulation
Kolmykov, S., Yevshin, I., Kulyashov, M., Sharipov, R., Kondrakhin, Y., Makeev, V. J., Kulakovskiy, I. V., Kel, A., & Kolpakov, F. (2021) · Nucleic Acids Research · doi:10.1093/nar/gkaa1057 · Cited by 282
Critical Success Factors of Business-managed IT: It Takes Two to Tango
Klotz, S., Westner, M., & Strahringer, S. (2022) · Information Systems Management · doi:10.1080/10580530.2021.1938300 · Cited by 12
Metadata
- Authors
- Lin, S.
- Venue
- WIREs Computational Statistics
- Publisher
- Wiley
- Published
- 2010-09
- Volume
- 2
- Issue
- 5
- Pages
- 555-570
- ISSN
- 1939-0068 (ISSN-L)
- 1939-5108
- OpenAlex
- W1968634175
- Cited by
- 215
- References
- 3
- FWCI
- 11.95
- 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: Rank aggregation methods. https://app.cochat.ai/papers/10.1002/wics.111
- The paper
- Lin, S. (2010). Rank aggregation methods. WIREs Computational Statistics. https://doi.org/10.1002/wics.111
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.