A Context-aware Time Model for Web Search

被引:26
作者
Borisov, Alexey [1 ,2 ]
Markov, Ilya [2 ]
de Rijke, Maarten [2 ]
Serdyukov, Pavel [1 ]
机构
[1] Yandex, Moscow, Russia
[2] Univ Amsterdam, Amsterdam, Netherlands
来源
SIGIR'16: PROCEEDINGS OF THE 39TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL | 2016年
关键词
Time modeling; User behavior; Web search;
D O I
10.1145/2911451.2911504
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In web search, information about times between user actions has been shown to be a good indicator of users' satisfaction with the search results. Existing work uses the mean values of the observed times, or fits probability distributions to the observed times. This implies a context-independence assumption that the time elapsed between a pair of user actions does not depend on the context, in which the first action takes place. We validate this assumption using logs of a commercial web search engine and discover that it does not always hold. For between 37% to 80% of query-result pairs, depending on the number of observations, the distributions of click dwell times have statistically significant differences in query sessions for which a given result (i) is the first item to be clicked and (ii) is not the first. To account for this context bias effect, we propose a context-aware time model (CATM). The CATM allows us (i) to predict times between user actions in contexts, in which these actions were not observed, and (ii) to compute context-independent estimates of the times by predicting them in predefined contexts. Our experimental results show that the CATM provides better means than existing methods to predict and interpret times between user actions.
引用
收藏
页码:205 / 214
页数:10
相关论文
共 46 条
[1]  
Agichtein E., 2006, Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P3, DOI 10.1145/1148170.1148175
[2]  
Agichtein E., 2006, Proceedings of the Twenty-Ninth Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, P19, DOI 10.1145/1148170.1148177
[3]  
[Anonymous], 2008, P 2008 INT C WEB SEA, DOI [10.1145/1341531.1341545, 10.1145/1341531, DOI 10.1145/1341531.1341545]
[4]  
Arguello Jaime, 2014, Advances in Information Retrieval. 36th European Conference on IR Research, ECIR 2014. Proceedings: LNCS 8416, P88, DOI 10.1007/978-3-319-06028-6_8
[5]   LEARNING LONG-TERM DEPENDENCIES WITH GRADIENT DESCENT IS DIFFICULT [J].
BENGIO, Y ;
SIMARD, P ;
FRASCONI, P .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (02) :157-166
[6]   Learning Deep Architectures for AI [J].
Bengio, Yoshua .
FOUNDATIONS AND TRENDS IN MACHINE LEARNING, 2009, 2 (01) :1-127
[7]   A Neural Click Model for Web Search [J].
Borisov, Alexey ;
Markov, Ilya ;
de Rijke, Maarten ;
Serdyukov, Pavel .
PROCEEDINGS OF THE 25TH INTERNATIONAL CONFERENCE ON WORLD WIDE WEB (WWW'16), 2016, :531-541
[8]  
Buscher Georg., 2012, WSDM, P373, DOI [10.1145/2124295.2124341, DOI 10.1145/2124295.2124341]
[9]  
Chapelle O., 2012, ACM T INFORM SYSTEMS, V30, P6
[10]  
Chapelle O., 2011, JMLR Workshop and Conference Proceedings, P1