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
相关论文
共 50 条
  • [31] Potentiality of Healthcare Big data: Improving Search by Automatic Query Reformulation
    Wang, Yueyao
    Hu, Qinmin
    Song, Yang
    He, Liang
    2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA (BIG DATA), 2017, : 807 - 816
  • [32] Evaluating the accuracy of implicit feedback from clicks and query reformulations in Web search
    Joachims, Thorsten
    Granka, Laura
    Pan, Bing
    Hembrooke, Helene
    Radlinski, Filip
    Gay, Geri
    ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2007, 25 (02)
  • [33] Query reformulation with constraints
    Deutsch, A
    Popa, L
    Tannen, V
    SIGMOD RECORD, 2006, 35 (01) : 65 - 73
  • [34] Query Performance Prediction for Conversational Search and Beyond
    Meng, Chuan
    PROCEEDINGS OF THE 47TH INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH AND DEVELOPMENT IN INFORMATION RETRIEVAL, SIGIR 2024, 2024, : 3077 - 3077
  • [35] Query Reformulation by Leveraging Crowd Wisdom for Scenario-based Software Search
    Li, Zhixing
    Wang, Tao
    Zhang, Yang
    Zhan, Yun
    Yin, Gang
    8TH ASIA-PACIFIC SYMPOSIUM ON INTERNETWARE (INTERNETWARE 2016), 2016, : 36 - 44
  • [36] Interactive System Based on Web Search Results Clustering for Arabic Query Reformulation
    Sahmoudi, Issam
    Lachkar, Abdelmonaime
    2014 THIRD IEEE INTERNATIONAL COLLOQUIUM IN INFORMATION SCIENCE AND TECHNOLOGY (CIST'14), 2014, : 300 - 305
  • [37] A Novel Approach to Personalize Web Search through User Profiling and Query Reformulation
    Makvana, Kamlesh
    Shah, Pinal
    Shah, Parth
    2014 INTERNATIONAL CONFERENCE ON DATA MINING AND INTELLIGENT COMPUTING (ICDMIC), 2014,
  • [38] QUERY REFORMULATION: AN INTERPLAY OF USER'S REFORMULATION BEHAVIOR AND THEMATIC CONTEXT IN ORIGINAL QUERY
    Bhatia, M. P. S.
    Kumar, Akshi
    PROCEEDINGS OF THE 2009 INTERNATIONAL CONFERENCE ON SOFTWARE TECHNOLOGY AND ENGINEERING, 2009, : 30 - +
  • [39] Incorporating Clicks, Attention and Satisfaction into a Search Engine Result Page Evaluation Model
    Chuklin, Aleksandr
    de Rijke, Maarten
    CIKM'16: PROCEEDINGS OF THE 2016 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT, 2016, : 175 - 184
  • [40] Graph Query Reformulation with Diversity
    Mottin, Davide
    Bonchi, Francesco
    Gullo, Francesco
    KDD'15: PROCEEDINGS OF THE 21ST ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2015, : 825 - 834