Abstract
Which queries stand to gain or loose from diversifying their results? Some queries are more difficult than others for diversification. Across a number of conceptually different diversification methods, performance on such queries tends to deteriorate after applying these diversification methods, even though their initial performance in terms of relevance or diversity tends to be good.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Agrawal, R., Gollapudi, S., Halverson, A., Ieong, S.: Diversifying Search Results. In: WSDM’09 (2009)
Blei, D., Ng, A., Jordan, M., Lafferty, J.: Latent Dirichlet Allocation. In: JMLR (2003)
Carbonell, J., Goldstein, J.: The Use of MMR, Diversity-based Reranking for Reordering Documents and Producing Summaries. In: SIGIR’98 (1998)
Clarke, C., Kolla, M., Cormack, G., Vechtomova, O., Ashkan, A., Büttcher, S., Mackinnon, I.: Novelty and Diversity in Information Retrieval Evaluation. In: SIGIR’08 (2008)
He, J., Meij, E., de Rijke, M.: Result Diversification Based on Query-specific Cluster Ranking. JASIST 62(3) (2011)
Metzler, D., Croft, W.B.: A Markov Random Field Model for Term Dependencies. In: SIGIR’05 (2005)
Santos, R., Macdonald, C., Ounis, I.: Selectively Diversifying Web Search Results. In: CIKM’10 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, J., Bron, M., de Rijke, M. (2011). A Query Performance Analysis for Result Diversification. In: Amati, G., Crestani, F. (eds) Advances in Information Retrieval Theory. ICTIR 2011. Lecture Notes in Computer Science, vol 6931. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23318-0_37
Download citation
DOI: https://doi.org/10.1007/978-3-642-23318-0_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23317-3
Online ISBN: 978-3-642-23318-0
eBook Packages: Computer ScienceComputer Science (R0)