Learning to Attend, Copy, and Generate for Session-Based Query Suggestion

被引:61
作者
Dehghani, Mostafa [1 ,2 ]
Rothe, Sascha [2 ]
Alfonseca, Enrique [2 ]
Fleury, Pascal [2 ]
机构
[1] Univ Amsterdam, Amsterdam, Netherlands
[2] Google Res, Amsterdam, Netherlands
来源
CIKM'17: PROCEEDINGS OF THE 2017 ACM CONFERENCE ON INFORMATION AND KNOWLEDGE MANAGEMENT | 2017年
关键词
Sequence to Sequence Model; Query Suggestion; Query-Aware Attention; Copy Mechanism; RECOMMENDATION;
D O I
10.1145/3132847.3133010
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Users try to articulate their complex informationneeds during search sessions by reformulating their queries. To make this process more effective, search engines provide related queries to help users in specifying the information need in their search process. In this paper we propose a customized sequence-to-sequence model for session based query suggestion. In our model, we employ a query-aware attention mechanism to capture the structure of the session context. This enables us to control the scope of the session from which we infer the suggested next query, which helps not only handle the noisy data but also automatically detect session boundaries. Furthermore we observe that, based on the user query reformulation behavior, within a single session a large portion of query terms is retained from the previously submitted queries and consists of mostly infrequent or unseen terms that are usually not included in the vocabulary. We therefore empower the decoder of our model to access the source words from the session context during decoding by incorporating a copy mechanism. Moreover, we propose evaluation metrics to assess the quality of the generative models for query suggestion. We conduct an extensive set of experiments and analysis. The results suggest that our model outperforms the baselines both in terms of the generating queries and scoring candidate queries for the task of query suggestion.
引用
收藏
页码:1747 / 1756
页数:10
相关论文
共 48 条
  • [1] ABADI M, 2015, TENSORFLOW LARGE SCA, DOI DOI 10.48550/ARXIV.1605.08695
  • [2] [Anonymous], 2008, P 17 ACM C INF KNOWL
  • [3] [Anonymous], P INT C LEARN REPR I
  • [4] [Anonymous], 2004, P 13 TEXT RETRIEVAL
  • [5] [Anonymous], 2009, P 2009 WORKSH WEB SE, DOI DOI 10.1145/1507509.1507518
  • [6] [Anonymous], 2010, Proceedings of the 19th international conference on World wide web, WWW '10
  • [7] [Anonymous], 2013, 22 INT WORLD WIDE WE
  • [8] [Anonymous], 2011, P 20 INT C WORLD WID, DOI DOI 10.1145/1963405.1963424
  • [9] [Anonymous], NIPS
  • [10] BaezaYates R, 2004, LECT NOTES COMPUT SC, V3268, P588