ABSTRACT
We study the problem of diversifying search results by exploiting the knowledge mined from query logs. Our proposal exploits the presence of different "specializations" of queries in query logs to detect the submission of ambiguous/faceted queries, and manage them by diversifying the search results returned in order to cover the different possible interpretations of the query. We present an original formulation of the results diversification problem in terms of an objective function to be maximized that admits the finding of an optimal solution in linear time.
- R. Agrawal, S. Gollapudi, A. Halverson, and S. Ieong. Diversifying search results. In Proc. ACM WSDM'09. Google ScholarDigital Library
- G. Amati, E. Ambrosi, M. Bianchi, and C. Gaibisso. FUB, IASI-CNR and University of Tor Vergata at TREC 2007 Blog Track. In Proc. TREC, 2007.Google Scholar
- A. Anagnostopoulos, A. Z. Broder, and D. Carmel. Sampling search-engine results. In WWW'05, ACM. Google ScholarDigital Library
- P. Boldi, F. Bonchi, C. Castillo, and S. Vigna. From 'dango' to 'cakes': Query reformulation models and patterns. In Proc. WI'09. IEEE CS Press, 2009. Google ScholarDigital Library
- D. Broccolo, L. Marcon, F. M. Nardini, R. Perego, and F. Silvestri. An efficient algorithm to generate search shortcuts. Technical Report 2010-TR-017, ISTI CNR Pisa.Google Scholar
- R. Santos, C. Macdonald, and I. Ounis. Exploiting query reformulations for web search result diversification. In Proc. WWW'10. ACM Press, 2010. Google ScholarDigital Library
- F. Silvestri. Mining query logs: Turning search usage data into knowledge. Foundations and Trends in Information Retrieval, 1(1-2):1--174, 2010. Google ScholarDigital Library
Index Terms
- Efficient diversification of search results using query logs
Recommendations
Re-ranking search results using query logs
CIKM '06: Proceedings of the 15th ACM international conference on Information and knowledge managementThis work addresses two common problems in search, frequently occurring with underspecified user queries: the top-ranked results for such queries may not contain documents relevant to the user's search intent, and fresh and relevant pages may not get ...
Query suggestions in the absence of query logs
SIGIR '11: Proceedings of the 34th international ACM SIGIR conference on Research and development in Information RetrievalAfter an end-user has partially input a query, intelligent search engines can suggest possible completions of the partial query to help end-users quickly express their information needs. All major web-search engines and most proposed methods that ...
Analyzing and evaluating query reformulation strategies in web search logs
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementUsers frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research has studied how web search engines can propose reformulations, but has ...
Comments