Beyond Clicks: Query Reformulation as a Predictor of Search Satisfaction

被引:0
作者
Hassan, Ahmed [1 ]
Shi, Xiaolin [2 ]
Craswell, Nick [2 ]
Ramsey, Bill [2 ]
机构
[1] Microsoft Res, One Microsoft Way, Redmond, WA 98052 USA
[2] Microsoft Bing, Redmond, WA 98052 USA
来源
PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13) | 2013年
关键词
Re-querying behavior; success prediction; search tasks;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To understand whether a user is satisfied with the current search results, implicit behavior is a useful data source, with clicks being the best-known implicit signal. However, it is possible for a non-clicking user to be satisfied and a clicking user to be dissatisfied. Here we study additional implicit signals based on the relationship between the user's current query and the next query, such as their textual similarity and the inter-query time. Using a large unlabeled dataset, a labeled dataset of queries and a labeled dataset of user tasks, we analyze the relationship between these signals. We identify an easily-implemented rule that indicates dissatisfaction: that a similar query issued within a time interval that is short enough (such as five minutes) implies dissatisfaction. By incorporating additional query-based features in the model, we show that a query-based model (with no click information) can indicate satisfaction more accurately than click-based models. The best model uses both query and click features. In addition, by comparing query sequences in successful tasks and unsuccessful tasks, we observe that search success is an incremental process for successful tasks with multiple queries.
引用
收藏
页码:2019 / 2028
页数:10
相关论文
empty
未找到相关数据