Diversifying search results
- 9 February 2009
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the Second ACM International Conference on Web Search and Data Mining - WSDM '09
Abstract
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one category according to this taxonomy. We present a systematic approach to diversifying results that aims to minimize the risk of dissatisfaction of the average user. We propose an algorithm that well approximates this objective in general, and is provably optimal for a natural special case. Furthermore, we generalize several classical IR metrics, including NDCG, MRR, and MAP, to explicitly account for the value of diversification. We demonstrate empirically that our algorithm scores higher in these generalized metrics compared to results produced by commercial search engines.Keywords
This publication has 14 references indexed in Scilit:
- Efficient Computation of Diverse Query ResultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Learning diverse rankings with multi-armed banditsPublished by Association for Computing Machinery (ACM) ,2008
- Improving personalized web search using result diversificationPublished by Association for Computing Machinery (ACM) ,2006
- Less is morePublished by Association for Computing Machinery (ACM) ,2006
- A risk minimization framework for information retrievalInformation Processing & Management, 2006
- Improving recommendation lists through topic diversificationPublished by Association for Computing Machinery (ACM) ,2005
- The use of MMR, diversity-based reranking for reordering documents and producing summariesPublished by Association for Computing Machinery (ACM) ,1998
- Beyond topicality: A two stage view of relevance and the retrieval processInformation Processing & Management, 1982
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- A searching procedure for information retrievalInformation Storage and Retrieval, 1964