Beyond Independent Relevance: Methods and Evaluation Metrics for Subtopic Retrieval
The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
We present a non-traditional retrieval problem we call subtopic retrieval. The subtopic retrieval problem is concerned with finding documents that cover many different subtopics of a query topic. In such a problem, the utility of a document in a ranking is dependent on other documents in the ranking, violating the assumption of independent relevance which is assumed in most traditional retrieval methods. Subtopic retrieval poses challenges for evaluating performance, as well as for developing effective algorithms. We propose a framework for evaluating subtopic retrieval which generalizes the traditional precision and recall metrics by accounting for intrinsic topic difficulty as well as redundancy in documents. We propose and systematically evaluate several methods for performing subtopic retrieval using statistical language models and a maximal marginal relevance (MMR) ranking strategy. A mixture model combined with query likelihood relevance ranking is shown to modestly outperform a baseline relevance ranking on a data set used in the TREC interactive track.
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
A threshold of ln n for approximating set cover
Feige, U. (1998) · Journal of the ACM · doi:10.1145/285055.285059 · Cited by 3,086
The use of MMR, diversity-based reranking for reordering documents and producing summaries
Carbonell, J., & Goldstein, J. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.291025 · Cited by 2,329
The Use of MMR, Diversity-Based Reranking for Reordering Documents and Producing Summaries
Carbonell, J., & Goldstein, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130369 · Cited by 2,156
A Study of Smoothing Methods for Language Models Applied to Ad Hoc Information Retrieval
Zhai, C., & Lafferty, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130377 · Cited by 1,537
Self-citationIR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130374 · Cited by 1,444
THE PROBABILITY RANKING PRINCIPLE IN IR
ROBERTSON, S. E. (1977) · Journal of Documentation · doi:10.1108/eb026647 · Cited by 1,103 · cited 2×
“Some of the issues concerning ranking interdependent documents are discussed in [11, 13].”
BackgroundIR evaluation methods for retrieving highly relevant documents
Järvelin, K., & Kekäläinen, J. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345545 · Cited by 967
A study of smoothing methods for language models applied to Ad Hoc information retrieval
Zhai, C., & Lafferty, J. (2001) · Proceedings of the 24th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/383952.384019 · Cited by 889
Self-citationModel-based feedback in the language modeling approach to information retrieval
Zhai, C., & Lafferty, J. (2001) · Proceedings of the tenth international conference on Information and knowledge management · doi:10.1145/502585.502654 · Cited by 787
Self-citation
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
Learning to Rank for Information Retrieval
Liu, T.-Y. (2009) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000016 · Cited by 1,568
Agrawal, R., Gollapudi, S., Halverson, A., & Ieong, S. (2009) · Proceedings of the Second ACM International Conference on Web Search and Data Mining · doi:10.1145/1498759.1498766 · Cited by 1,020
Novelty and diversity in information retrieval evaluation
Clarke, C. L. A., Kolla, M., Cormack, G. V., Vechtomova, O., Ashkan, A., Büttcher, S., & MacKinnon, I. (2008) · Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1390334.1390446 · Cited by 962
Expected reciprocal rank for graded relevance
Chapelle, O., Metlzer, D., Zhang, Y., & Grinspan, P. (2009) · Proceedings of the 18th ACM conference on Information and knowledge management · doi:10.1145/1645953.1646033 · Cited by 832
Improving Aggregate Recommendation Diversity Using Ranking-Based Techniques
Adomavicius, G., & Kwon, Y. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2011.15 · Cited by 675
Learning diverse rankings with multi-armed bandits
Radlinski, F., Kleinberg, R., & Joachims, T. (2008) · Proceedings of the 25th international conference on Machine learning - ICML '08 · doi:10.1145/1390156.1390255 · Cited by 503
Determinantal Point Processes for Machine Learning
Kulesza, A. (2012) · now publishers, Inc. eBooks · doi:10.1561/9781601986290 · Cited by 493
Test Collection Based Evaluation of Information Retrieval Systems
Sanderson, M. (2010) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000009 · Cited by 485
LETOR: A benchmark collection for research on learning to rank for information retrieval
Qin, T., Liu, T.-Y., Xu, J., & Li, H. (2010) · Information Retrieval · doi:10.1007/s10791-009-9123-y · Cited by 461
Exploiting query reformulations for web search result diversification
Santos, R. L. T., Macdonald, C., & Ounis, I. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772780 · Cited by 441
An axiomatic approach for result diversification
Gollapudi, S., & Sharma, A. (2009) · Proceedings of the 18th international conference on World wide web · doi:10.1145/1526709.1526761 · Cited by 389
Practical elimination of near-duplicates from web video search
Wu, X., Hauptmann, A. G., & Ngo, C.-W. (2007) · Proceedings of the 15th ACM international conference on Multimedia · doi:10.1145/1291233.1291280 · Cited by 340
Less is more: probabilistic models for retrieving fewer relevant documents
Chen, H., & Karger, D. R. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148245 · Cited by 319
Statistical Language Models for Information Retrieval A Critical Review
Zhai, C. (2007) · Foundations and Trends® in Information Retrieval · doi:10.1561/1500000008 · Cited by 291
Self-citationDivRank: the interplay of prestige and diversity in information networks
Mei, Q., Guo, J., & Radev, D. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835931 · Cited by 180
Singhal, A., Neveditsin, N., Tanveer, H., & Mago, V. (2024) · JMIR Medical Informatics · doi:10.2196/50048 · Cited by 172
Toward a semantic granularity model for domain-specific information retrieval
Yan, X., Lau, R. Y. K., Song, D., Li, X., & Ma, J. (2011) · ACM Transactions on Information Systems · doi:10.1145/1993036.1993039 · Cited by 56
Benchmarking LLM-based Relevance Judgment Methods
Arabzadeh, N., & Clarke, C. L. A. (2025) · Proceedings of the 48th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3726302.3730305 · Cited by 46
Composite Retrieval of Diverse and Complementary Bundles
Amer-Yahia, S., Bonchi, F., Castillo, C., Feuerstein, E., Mendez-Diaz, I., & Zabala, P. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2306678 · Cited by 42
Composite retrieval of heterogeneous web search
Bota, H., Zhou, K., Jose, J. M., & Lalmas, M. (2014) · Proceedings of the 23rd international conference on World wide web · doi:10.1145/2566486.2567985 · Cited by 32
Detecting duplicate web documents using clickthrough data
Radlinski, F., Bennett, P. N., & Yilmaz, E. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935859 · Cited by 19
Coverage-based search result diversification
Zheng, W., Wang, X., Fang, H., & Cheng, H. (2012) · Information Retrieval · doi:10.1007/s10791-011-9178-4 · Cited by 16
Metadata
- Authors
- Zhai, C., Cohen, W. W., & Lafferty, J.
- Venue
- ACM SIGIR Forum
- Published
- 2015-06-23
- Volume
- 49
- Issue
- 1
- Pages
- 2-9
- ISSN
- 0163-5840 (ISSN-L)
- OpenAlex
- W2197919320
- Cited by
- 558
- References
- 17
- FWCI
- 103.61
- Type
- journal article
- 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.