Bypass rates: Reducing query abandonment using negative inferences

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 177-185

  Sarma, Atish Das ^a   Gollapudi, Sreenivas ^b   Ieong, Samuel ^c  

^a Georgia Institute of Technology   (United States)

^b MICROSOFT RESEARCH   (United States)

^c Stanford University   (United States)

Author keywords

Bypass rates; Query abandonment; Random walk; Relevance; Similarity search

Indexed keywords

BYPASS RATES; QUERY ABANDONMENT; RANDOM WALK; RELEVANCE; SIMILARITY SEARCH;

MINING;

INFORMATION MANAGEMENT;

EID: 65449122821     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401916     Document Type: Conference Paper

References (21)

1. Jaime G. Carbonell and Jade Goldstein. The use of MMR, diversity-based reranking for reordering documents and producing summaries. In SIGIR, pages 335-336, 1998.
2. A. K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari. The electrical resistance of a graph captures its commute and cover times (detailed abstract). In STOC, pages 574-586, 1989.
3. Harr Chen and David R. Karger. Less is more: probabilistic models for retrieving fewer relevant documents. In SIGIR, pages 429-436, 2006.
4. F. R. Chung, editor. Spectral Graph Theory. American Mathematical Society, 1997.
5. Nick Craswell and Martin Szummer. Random walks on the click graph. In SIGIR, pages 239-246, 2007.
6. F. Fauss, A. Pirotte, J-M. Renders, and M. Saerens. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering, 19(3):355-369, 2007.
7. F. Gobel and A. Jagers. Random walks on graphs. Stochastic Processes and their App., 2:311-336, 1974.
8. Thorsten Joachims. Optimizing search engines using clickthrough data. In KDD, pages 133-142, 2002.
9. Thorsten Joachims, Laura A. Granka, Bing Pan, Helene Hembrooke, and Geri Gay. Accurately interpreting clickthrough data as implicit feedback. In SIGIR, pages 154-161, 2005.
10. A. V. Leouski and W. B. Croft. An evaluation of techniques for clustering search results. Technical Report IR-76, University of Amherst, 1996.
11. D. Lozovanu and A. Zelikovsky. Minimal and bounded tree problems. In Tezele Congresului XVIII al Academiei Romano-Americane, pages 25-26, 1993.
12. M. Newman. A measure of betweenness centrality based on random walks. Social Net, 27(1):39-54, 2005.
13. P.G.Doyle and J.L.Snell, editors. Random Walks and Electric Networks. Math. Assoc. of America, 1984.
14. F. Radlinksy, R. Kleinberg, and T. Joachims. Learning diverse rankings with multi-armed bandits. In ICML, 2008.
15. Filip Radlinski and Thorsten Joachims. Minimally invasive randomization fro collecting unbiased preferences from clickthrough logs. In AAAI, 2006.
16. Filip Radlinski and Thorsten Joachims. Active exploration for learning rankings from clickthrough data. In KDD, pages 570-579, 2007.
17. R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel J. Rosenkrantz, and S. S. Ravi. Spanning trees short or small. In SODA, pages 546-555, 1994.
18. Stephen Robertson. The probability ranking principle in ir. Journal of Documentation, 33(4):294-304, 1977.
19. H. Zaragoza, N. Craswell, M. Taylor, S. Saria, , and S. Robertson. Microsoft Cambridge at trec-12: Web and hard track. In Proc. of the 18th Text Retrieval Conference, pages 418-425, 2003.
20. C. Zhai, W. Cohen, and J.D. Lafferty. Beyond independent relevance: methods and evaluation metrics for subtopic retrieval. In SIGIR, pages 10-17, 2003.
21. ChengXiang Zhai and John D. Lafferty. A risk minimzation framework for information retrieval. Info. Processing and Management, 42(1):31-55, 2006.