For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

University of Edinburgh

Return to search Previous output Next output
Output 153 of 401 in the submission
Output title

Fast query expansion using approximations of relevance models

Type
E - Conference contribution
Name of conference/published proceedings
Proceedings of the 19th ACM international conference on Information and knowledge management (CIKM '10)
Volume number
-
Issue number
-
First page of article
1573
ISSN of proceedings
-
Year of publication
2010
Number of additional authors
3
Additional information

<17> Originality: We present an algorithm that speeds up the runtime of relevance models by more than two orders of magnitude. The algorithm is based on auxiliary structures, created at indexing time. We explore randomised techniques and distributed architectures for creating these structures efficiently.

Significance: Relevance models give excellent retrieval accuracy, but are very slow. This limits their application in many domains. Our algorithm reduces the run-time by 99% and allows applications on web-scale corpora.

Rigour: Published in ACM CIKM -- an international conference with a 17% acceptance rate and a high impact factor (#3 worldwide in Information Retrieval).

Interdisciplinary
-
Cross-referral requested
-
Research group
D - Institute for Language, Cognition & Computation
Citation count
3
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-