The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Models for metasearch
Abstract
Given the ranked lists of documents returned by multiple search engines in response to a given query, the problem ofmetasearchis to combine these lists in a way which optimizes the performance of the combination. This paper makes three contributions to the problem of metasearch: (1) We describe and investigate a metasearch model based on an optimal democratic voting procedure, the Borda Count; (2) we describe and investigate a metasearch model based on Bayesian inference; and (3) we describe and investigate a model for obtaining upper bounds on the performance of metasearch algorithms. Our experimental results show that metasearch algorithms based on the Borda and Bayesian models usually outperform the best input system and are competitive with, and often outperform, existing metasearch strategies. Finally, our initial upper bounds demonstrate that there is much to learn about the limits of the performance of metasearch.
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
The eighth text REtrieval conference (TREC-8)
(2000) · doi:10.6028/nist.sp.500-246 · Cited by 336
Fusion Via a Linear Combination of Scores
Vogt, C. C., & Cottrell, G. W. (1999) · Information Retrieval · doi:10.1023/a:1009980820262 · Cited by 311
Overview of the Eighth Text REtrieval Conference (TREC-8).
Voorhees, E. M., & Harman, D. K. (1999) · Cited by 303
Modeling score distributions for combining the outputs of search engines
Manmatha, R., Rath, T., & Feng, F. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.384005 · Cited by 207
Combining Approaches to Information Retrieval
Croft, W. B. (2005) · The Information Retrieval Series · doi:10.1007/0-306-47019-5_1 · Cited by 203
Explaining All Three-Alternative Voting Outcomes
Saari, D. G. (1999) · Journal of Economic Theory · doi:10.1006/jeth.1999.2541 · Cited by 149
The fifth text REtrieval conference (TREC-5)
(1997) · doi:10.6028/nist.sp.500-238 · Cited by 143
Variants of the Borda count method for combining ranked classifier hypotheses
van Erp, M., & Schomaker, L. (2000) · Cited by 134
Method combination for document filtering
Hull, D. A., Pedersen, J., & Schütze, H. (1996) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/243199.243275 · Cited by 103
The second text REtrieval conference (TREC-2)
(1993) · doi:10.6028/nist.sp.500-215 · Cited by 81
Cited by
Learning to rank for information retrieval
Liu, T.-Y. (2010) · Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1835449.1835676 · Cited by 1,856
Upadhya, S. R., & Ryan, C. J. (2022) · Cell Reports Methods · doi:10.1016/j.crmeth.2022.100288 · Cited by 81
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
Metadata
- Authors
- Aslam, J. A., & Montague, M.
- Venue
- Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2001-09
- Pages
- 276-284
- OpenAlex
- W1988686126
- Cited by
- 684
- References
- 12
- FWCI
- 11.70
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Models for metasearch. https://app.cochat.ai/papers/10.1145/383952.384007
- The paper
- Aslam, J. A., & Montague, M. (2001). Models for metasearch. Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval. https://doi.org/10.1145/383952.384007
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.