Abstract
To mitigate the problem of over-dependence of a pseudo-relevance feedback algorithm on the top-M document set, we make use of a set of equivalence classes of queries rather than one single query. These query equivalents are automatically constructed either from a) a knowledge base of prior distributions of terms with respect to the given query terms, or b) iteratively generated from a relevance model of term distributions in the absence of such priors. These query variants are then used to estimate the retrievability of each document with the hypothesis that documents that are more likely to be retrieved at top-ranks for a larger number of these query variants are more likely to be effective for relevance feedback. Results of our experiments show that our proposed method is able to achieve substantially better precision at top-ranks (e.g. higher nDCG@5 and P@5 values) for ad-hoc IR and points-of-interest (POI) recommendation tasks.
Original language | English |
---|---|
Title of host publication | Proceedings of the 29th ACM International Conference on Information & Knowledge Management |
Place of Publication | New York, NY, USA |
Publisher | Association for Computing Machinery (ACM) |
Pages | 125–134 |
Number of pages | 10 |
ISBN (Print) | 9781450368599 |
DOIs | |
Publication status | Published - 19 Oct 2020 |
Event | 29th ACM International Conference on Information and Knowledge Management - Omline Conference Duration: 19 Oct 2020 → 23 Oct 2020 https://www.cikm2020.org/index.html |
Publication series
Name | CIKM '20 |
---|---|
Publisher | Association for Computing Machinery |
Conference
Conference | 29th ACM International Conference on Information and Knowledge Management |
---|---|
Abbreviated title | CIKM 2020 |
City | Omline Conference |
Period | 19/10/20 → 23/10/20 |
Internet address |
Keywords
- pseudo-relevance feedback
- query variants
- retrievability