Vector-space ranking with effective early termination
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Considerable research effort has been invested in improving the effectiveness of information retrieval systems. Techniques such as relevance feedback, thesaural expansion, and pivoting all provide better quality responses to queries when tested in standard evaluation frameworks. But such enhancements can add to the cost of evaluating queries. In this paper we consider the pragmatic issue of how to improve the cost-effectiveness of searching. We describe a new inverted file structure using quantized weights that provides superior retrieval effectiveness compared to conventional inverted file structures when early termination heuristics are employed. That is, we are able to reach similar effectiveness levels with less computational cost, and so provide a better cost/performance compromise than previous inverted file organisations.
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
How reliable are the results of large-scale information retrieval experiments?
Zobel, J. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291014 · Cited by 579 · cited 1×
“…are also rather more reliable estimators in the environment used in our experiments, since the relevance judgements are partial rather than exhaustive, and it is possible that there is a non-trivial number of relevant documents that have not been so identified [Cormack et al., 1998, Zobel, 1998].”
Background
Cited by
Inverted files for text search engines
Zobel, J., & Moffat, A. (2006) · ACM Computing Surveys · doi:10.1145/1132956.1132959 · Cited by 1,081
Self-citationTop-k Query Evaluation with Probabilistic Guarantees
Theobald, M., Weikum, G., & Schenkel, R. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50058-9 · Cited by 223
“The pruning techniques considered here (see also [4,10, 21]) are heuristic in nature in that they trade off some loss in result quality (effectiveness in IR jargon) for speed without being able to predict and control the resulting effects (other than by experimentation).”
MethodFaster top-k document retrieval using block-max indexes
Ding, S., & Suel, T. (2011) · Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval · doi:10.1145/2009916.2010048 · Cited by 220
“Postings with the same impact are sorted by document ID. Note that this assumes that the ranking function is decomposable (i.e., a sum or other simple combination of per-term scores), which is true for Cosine, BM25, and many other functions in the literature.”
Background
Metadata
- Authors
- Anh, V. N., de Kretser, O., & Moffat, A.
- Venue
- Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval
- Publisher
- ACM
- Published
- 2001-09
- Pages
- 35-42
- OpenAlex
- W1991360400
- Cited by
- 207
- References
- 1
- FWCI
- 6.83
- 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.