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
关键词
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
相关论文
共 50 条
  • [1] SEARCH IMPROVEMENT VIA AUTOMATIC QUERY REFORMULATION
    GAUCH, S
    SMITH, JB
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 1991, 9 (03) : 249 - 280
  • [2] Query Reformulation in E-Commerce Search
    Hirsch, Sharon
    Guy, Ido
    Nus, Alexander
    Dagan, Arnon
    Kurland, Oren
    PROCEEDINGS OF THE 43RD INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL (SIGIR '20), 2020, : 1319 - 1328
  • [3] Influences on Query Reformulation in Collaborative Web Search
    Yue, Zhen
    Han, Shuguang
    He, Daqing
    Jiang, Jiepu
    COMPUTER, 2014, 47 (03) : 46 - 53
  • [4] ConvGQR: Generative Query Reformulation for Conversational Search
    Mo, Fengran
    Mao, Kelong
    Zhu, Yutao
    Wu, Yihong
    Huang, Kaiyu
    Nie, Jian-Yun
    PROCEEDINGS OF THE 61ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, VOL 1, 2023, : 4998 - 5012
  • [5] Collaborative query reformulation in tourism information search
    Du, Jia Tina
    Arif, Abu Shamim Mohammad
    Hansen, Preben
    ONLINE INFORMATION REVIEW, 2019, 43 (07) : 1115 - 1135
  • [6] Investigating Query Reformulation Behavior of Search Users
    Chen, Jia
    Mao, Jiaxin
    Liu, Yiqun
    Zhang, Min
    Ma, Shaoping
    INFORMATION RETRIEVAL (CCIR 2019), 2019, 11772 : 39 - 51
  • [7] Improving Query Reformulation in Voice Search Systemorg
    Sa, Ning
    PROCEEDINGS OF THE 2016 ACM CONFERENCE ON HUMAN INFORMATION INTERACTION AND RETRIEVAL (CHIIR'16), 2016, : 365 - 367
  • [8] Video Search with CLIP and Interactive Text Query Reformulation
    Lokoc, Jakub
    Vopalkova, Zuzana
    Dokoupil, Patrik
    Peska, Ladislav
    MULTIMEDIA MODELING, MMM 2023, PT I, 2023, 13833 : 628 - 633
  • [9] Location-aware query reformulation for search engines
    Huang, Zhipeng
    Qian, Yuqiu
    Mamoulis, Nikos
    GEOINFORMATICA, 2018, 22 (04) : 869 - 893
  • [10] Self-Supervised Query Reformulation for Code Search
    Mao, Yuetian
    Wan, Chengcheng
    Jiang, Yuze
    Gu, Xiaodong
    PROCEEDINGS OF THE 31ST ACM JOINT MEETING EUROPEAN SOFTWARE ENGINEERING CONFERENCE AND SYMPOSIUM ON THE FOUNDATIONS OF SOFTWARE ENGINEERING, ESEC/FSE 2023, 2023, : 363 - 374