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 条
  • [21] Interactive Query Reformulation for Source-Code Search With Word Relations
    Lu, Jinting
    Wei, Ying
    Sun, Xiaobing
    Li, Bin
    Wen, Wanzhi
    Zhou, Cheng
    IEEE ACCESS, 2018, 6 : 75660 - 75668
  • [22] Improving ​conversational ​search with ​query ​reformulation ​using ​selective ​contextual ​history
    Al-Thani H.
    Elsayed T.
    Jansen B.J.
    Data and Information Management, 2023, 7 (02)
  • [23] A Probabilistic Topic Model with Social Tags for Query Reformulation in Informational Search
    Mao, Yuqing
    Shen, Haifeng
    Sun, Chengzheng
    ADVANCED DATA MINING AND APPLICATIONS, PT I, 2011, 7120 : 109 - +
  • [24] Query Reformulation For Specific Domain Search: Keywords, Ontology, Domain Name
    Azizan, Azilawati
    Abu Bakar, Zainab
    2015 INTERNATIONAL CONFERENCE ON ICT CONVERGENCE (ICTC), 2015, : 1283 - 1287
  • [25] Do Topic Shift and Query Reformulation Patterns Correlate in Academic Search?
    Li, Xinyi
    de Rijke, Maarten
    ADVANCES IN INFORMATION RETRIEVAL, ECIR 2017, 2017, 10193 : 146 - 159
  • [26] Efficient Algorithm for Web Search Query Reformulation Using Genetic Algorithm
    Singh, Vikram
    Garg, Siddhant
    Kaur, Pradeep
    COMPUTATIONAL INTELLIGENCE IN DATA MINING, VOL 1, CIDM 2015, 2016, 410 : 459 - 470
  • [27] Query Quality Prediction and Reformulation for Source Code Search: The Refoqus Tool
    Haiduc, Sonia
    De Rosa, Giuseppe
    Bavota, Gabriele
    Oliveto, Rocco
    de Lucia, Andrea
    Marcus, Andrian
    PROCEEDINGS OF THE 35TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING (ICSE 2013), 2013, : 1307 - 1310
  • [28] Hyponymy Extraction and Web Search Behavior Analysis Based on Query Reformulation
    Costa, Rui P.
    Seco, Nuno
    ADVANCES IN ARTIFICIAL INTELLIGENCE - IBERAMIA 2008, PROCEEDINGS, 2008, 5290 : 332 - 341
  • [29] Query Reformulation Patterns of Mixed Language Queries in Different Search Intents
    Fu, Hengyi
    CHIIR'17: PROCEEDINGS OF THE 2017 CONFERENCE HUMAN INFORMATION INTERACTION AND RETRIEVAL, 2017, : 249 - 252
  • [30] Using query reformulation to compare learning behaviors in Web search engines
    Tibau, Marcelo
    Siqueira, Sean W. M.
    Nunes, Bernardo Pereira
    Nurmikko-Fuller, Terhi
    Manrique, Ruben Francisco
    2019 IEEE 19TH INTERNATIONAL CONFERENCE ON ADVANCED LEARNING TECHNOLOGIES (ICALT 2019), 2019, : 219 - 223