ABSTRACT
It is well known that clickthrough data can be used to improve the effectiveness of search results: broadly speaking, a query's past clicks are a predictor of future clicks on documents. However, when a new or unusual query appears, or when a system is not as widely used as a mainstream web search system, there may be little to no click data available to improve the results. Existing methods to boost query performance for sparse queries extend the query-document click relationship to more documents or queries, but require substantial clickthrough data from other queries. In this work we describe a way to boost rarely-clicked queries in a system where limited clickthrough data is available for all queries. We describe a probabilistic approach for carrying out that estimation and use it to rerank retrieved documents. We utilize information from co-click queries, subset queries, and synonym queries to estimate the clickthrough for a sparse query. Our experiments on a query log from a medical informatics company demonstrate that when overall clickthrough data is sparse, reranking search results using clickthrough information from related queries significantly outperforms reranking that employs clickthrough information from the query alone.
- E. Agichtein, E. Brill, and S. Dumais. Improving web search ranking by incorporating user behavior information. In Proceedings, SIGIR '06, pages 19--26, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- A. Al-Maskari, M. Sanderson, and P. Clough. The relationship between ir effectiveness measures and user satisfaction. In Proceedings, SIGIR '07, pages 773--774, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- J. Bar-Ilan, M. Mat-Hassan, and M. Levene. Methods for comparing rankings of search engine results. Comput. Netw., 50:1448--1463, July 2006. Google ScholarDigital Library
- M. Bendersky and W. B. Croft. Discovering key concepts in verbose queries. In Proceedings, SIGIR '08, pages 491--498, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- T. Brants and A. Franz. Google n-grams, Web 1T 5-gram Version 1, 2006.Google Scholar
- A. Broder, P. Ciccolo, E. Gabrilovich, V. Josifovski, D. Metzler, L. Riedel, and J. Yuan. Online expansion of rare queries for sponsored search. In Proceedings, WWW '09, pages 511--520, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- comScore. comScore Releases March 2011 U.S. Search Engine Rankings. http://www.comscore.com.Google Scholar
- N. Craswell and M. Szummer. Random walks on the click graph. In Proceedings, SIGIR '07, pages 239--246, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- Z. Dou, R. Song, X. Yuan, and J.-R. Wen. Are click-through data adequate for learning web search rankings? In Proceedings, CIKM '08, pages 73--82, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- J. Gao, W. Yuan, X. Li, K. Deng, and J.-Y. Nie. Smoothing clickthrough data for web search ranking. In Proceedings, SIGIR '09, pages 355--362, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- J. Huang and E. N. Efthimiadis. Analyzing and evaluating query reformulation strategies in web search logs. In Proceedings, CIKM '09, pages 77--86, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- K. Jarvelin and J. Kekalainen. Cumulated Gain-based Evaluation of IR Techniques. ACM Trans. Inf. Syst., 20:422--446, October 2002. Google ScholarDigital Library
- X.-M. Jiang, W.-G. Song, and H.-J. Zeng. Applying associative relationship on the clickthrough data to improve web search. In Advances in Information Retrieval, volume 3408 of Lecture Notes in Computer Science, pages 475--486. Springer Berlin / Heidelberg, 2005. Google ScholarDigital Library
- T. Joachims, L. Granka, B. Pan, H. Hembrooke, and G. Gay. Accurately interpreting clickthrough data as implicit feedback. In Proceedings, SIGIR '05, pages 154--161, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- T. Joachims, L. Granka, B. Pan, H. Hembrooke, F. Radlinski, and G. Gay. Evaluating the accuracy of implicit feedback from clicks and query reformulations in web search. ACM Trans. Inf. Syst., 25, April 2007. Google ScholarDigital Library
- R. Kumar and S. Vassilvitskii. Generalized distances between rankings. In Proceedings, WWW '10, pages 571--580, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- A. Mastora, M. Monopoli, and S. Kapidakis. Exploring query formulation and reformulation: A preliminary study to map users' search behaviour. In Research and Advanced Technology for Digital Libraries, volume 5173 of Lecture Notes in Computer Science, pages 427--430. Springer Berlin / Heidelberg, 2008. Google ScholarDigital Library
- J. Pickens, M. Cooper, and G. Golovchinsky. Reverted indexing for feedback and expansion. In Proceedings, CIKM '10, pages 1049--1058, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- J. M. Ponte and W. B. Croft. A language modeling approach to information retrieval. In Proceedings, SIGIR '98, pages 275--281, New York, NY, USA, 1998. ACM. Google ScholarDigital Library
- F. Radlinski and T. Joachims. Query chains: learning to rank from implicit feedback. In Proceedings, KDD '05, pages 239--248, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- S. E. Robertson, E. Kanoulas, and E. Yilmaz. Extending Average Precision to Graded Relevance Judgments. In Proceedings, SIGIR '10, pages 603--610, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- X. Wei, F. Peng, H. Tseng, Y. Lu, and B. Dumoulin. Context sensitive synonym discovery for web search queries. In Proceedings, CIKM '09, pages 1585--1588, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- G.-R. Xue, H.-J. Zeng, Z. Chen, Y. Yu, W.-Y. Ma, W. Xi, and W. Fan. Optimizing web search using web click-through data. In Proceedings, CIKM '04, pages 118--126, New York, NY, USA, 2004. ACM. Google ScholarDigital Library
- H. Zaragoza, B. B. Cambazoglu, and R. Baeza-Yates. Web search solved?: all result rankings the same? In Proceedings, CIKM '10, pages 529--538, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- M. Zhao, H. Li, A. Ratnaparkhi, H.-W. Hon, and J. Wang. Adapting document ranking to users' preferences using click-through data. In Information Retrieval Technology, volume 4182 of Lecture Notes in Computer Science, pages 26--42. Springer Berlin / Heidelberg, 2006. Google ScholarDigital Library
Index Terms
- Reranking search results for sparse queries
Recommendations
Optimizing video search reranking via minimum incremental information loss
MIR '08: Proceedings of the 1st ACM international conference on Multimedia information retrievalThis paper is concerned with video search reranking - the task of reordering the initial ranked documents (video shots) to improve the search performance - in an optimization framework. Conventional supervised reranking approaches empirically convert ...
Reranking web search results for diversity
AbstractSearch engine results are often biased towards a certain aspect of a query or towards a certain meaning for ambiguous query terms. Diversification of search results offers a way to supply the user with a better balanced result set increasing the ...
Expert agreement and content based reranking in a meta search environment using Mearf
WWW '02: Proceedings of the 11th international conference on World Wide WebRecent increase in the number of search engines on the Web and the availability of meta search engines that can query multiple search engines makes it important to find effective methods for combining results coming from different sources. In this paper ...
Comments