A Survey of Query Auto Completion in Information Retrieval

被引:91
作者
Cai, Fei [1 ,2 ]
de Rijke, Maarten [2 ]
机构
[1] Natl Univ Def Technol, Sci & Technol Informat Syst Engn Lab, Changsha, Hunan, Peoples R China
[2] Univ Amsterdam, Amsterdam, Netherlands
来源
FOUNDATIONS AND TRENDS IN INFORMATION RETRIEVAL | 2016年 / 10卷 / 04期
关键词
WEB;
D O I
10.1561/1500000055
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In information retrieval, query auto completion (QAC), also known as type-ahead [Xiao et al., 2013, Cai et al., 2014b] and auto-complete suggestion [Jain and Mishne, 2010], refers to the following functionality: given a prefix consisting of a number of characters entered into a search box, the user interface proposes alternative ways of extending the prefix to a full query. Ranking query completions is a challenging task due to the limited length of prefixes entered by users, the large volume of possible query completions matching a prefix, and the broad range of possible search intents. In recent years, a large number of query auto completion approaches have been proposed that produce ranked lists of alternative query completions by mining query logs. In this survey, we review work on query auto completion that has been published before 2016. We focus mainly on web search and provide a formal definition of the query auto completion problem. We describe two dominant families of approaches to the query auto completion problem, one based on heuristic models and the other based on learning to rank. We also identify dominant trends in published work on query auto completion, viz. the use of time-sensitive signals and the use of user-specific signals. We describe the datasets and metrics that are used to evaluate algorithms for query auto completion. We also devote a chapter to efficiency and a chapter to presentation and interaction aspects of query auto completion. We end by discussing related tasks as well as potential research directions to further the area.
引用
收藏
页码:274 / +
页数:91
相关论文
共 186 条
[1]  
Agrawal R., 2009, P 2 ACM INT C WEB SE, DOI DOI 10.1145/1498759.1498766
[2]  
Amin A, 2009, LECT NOTES COMPUT SC, V5478, P521, DOI 10.1007/978-3-642-00958-7_46
[3]  
Anagnostopoulos Aris., 2010, Proceedings of the Third International Conference on Web Search and Web Data Mining, WSDM 2010, New York, NY, USA, February 4-6, 2010, P161
[4]  
[Anonymous], 2012, P 5 ACM INT C WEB SE
[5]  
[Anonymous], 2008, P 17 ACM C INF KNOWL
[6]  
[Anonymous], 2006, Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06), DOI [10.1145/1150402.1150493, DOI 10.1145/1150402.1150493]
[7]  
[Anonymous], 2004, Proceedings of the 2004 ACM SIGMOD international conference on Management of data
[8]  
[Anonymous], 2008, P 2008 INT C WEB SEA, DOI [10.1145/1341531.1341545, 10.1145/1341531, DOI 10.1145/1341531.1341545]
[9]  
[Anonymous], 2007, P 16 INT C WORLD WID, DOI DOI 10.1145/1242572.1242643
[10]  
[Anonymous], 2009, CIKM, DOI DOI 10.1145/1645953.1646033