On the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off
Pages 1117 - 1118
Abstract
It has been previously noted that optimization of the n-call@k relevance objective (i.e., a set-based objective that is 1 if at least n documents in a set of k are relevant, otherwise 0) encourages more result set diversification for smaller n, but this statement has never been formally quantified. In this work, we explicitly derive the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off --- through fortuitous cancellations in the resulting combinatorial optimization, we show the trade-off is a simple and intuitive function of n (notably independent of the result set size k e n), where diversification increases as n approaches 1.
References
[1]
J. Carbonell and J. Goldstein. The use of MMR, diversity-based reranking for reording documents and producing summaries. In SIGIR-98. ACM, 1998.
[2]
H. Chen and D. R. Karger. Less is more: Probabilistic models for retrieving fewer relevant documents. In SIGIR-06. ACM, 2006.
[3]
S. Sanner, S. Guo, T. Graepel, S. Kharazmi, and S. Karimi. Diverse retrieval via greedy optimization of expected 1-call@k in a latent subtopic relevance model. In CIKM-11. ACM, 2011.
[4]
J. Wang and J. Zhu. Portfolio theory of information retrieval. In SIGIR-09. ACM, 2009.
[5]
C. Zhai, W. W. Cohen, and J. Lafferty. Beyond independent relevance: Methods and evaluation metrics for subtopic retrieval. In SIGIR-03. ACM, 2003.
Index Terms
- On the mathematical relationship between expected n-call@k and the relevance vs. diversity trade-off
Recommendations
Diverse retrieval via greedy optimization of expected 1-call@k in a latent subtopic relevance model
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementIt has been previously observed that optimization of the 1-call@k relevance objective (i.e., a set-based objective that is 1 if at least one document is relevant, otherwise 0) empirically correlates with diverse retrieval. In this paper, we proceed one ...
Probabilistic latent maximal marginal relevance
SIGIR '10: Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrievalDiversity has been heavily motivated in the information retrieval literature as an objective criterion for result sets in search and recommender systems. Perhaps one of the most well-known and most used algorithms for result set diversification is that ...
Jointly optimising relevance and diversity in image retrieval
CIVR '09: Proceedings of the ACM International Conference on Image and Video RetrievalIn this paper we present a method to jointly optimise the relevance and the diversity of the results in image retrieval. Without considering diversity, image retrieval systems often mainly find a set of very similar results, so called near duplicates, ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
August 2012
1236 pages
ISBN:9781450314725
DOI:10.1145/2348283
- General Chair:
- William Hersh,
- Program Chairs:
- Jamie Callan,
- Yoelle Maarek,
- Mark Sanderson
Copyright © 2012 Authors.
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 12 August 2012
Check for updates
Author Tags
Qualifiers
- Poster
Conference
SIGIR '12
Sponsor:
SIGIR '12: The 35th International ACM SIGIR conference on research and development in Information Retrieval
August 12 - 16, 2012
Oregon, Portland, USA
Acceptance Rates
Overall Acceptance Rate 792 of 3,983 submissions, 20%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 137Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 18 Nov 2024
Other Metrics
Citations
Cited By
View allView Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in