{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:18:44Z","timestamp":1775283524324,"version":"3.50.1"},"reference-count":68,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2016,6,9]],"date-time":"2016-06-09T00:00:00Z","timestamp":1465430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Elsevier"},{"name":"Netherlands Institute for Sound and Vision"},{"DOI":"10.13039\/501100003246","name":"Netherlands Organisation for Scientific Research","doi-asserted-by":"crossref","award":["727.011.005, 612.001.116, HOR-11-10, 640.006.013, 612.066.930, CI-14-25, SH-322-15, 652.002.001 and 612.001.551"],"award-info":[{"award-number":["727.011.005, 612.001.116, HOR-11-10, 640.006.013, 612.066.930, CI-14-25, SH-322-15, 652.002.001 and 612.001.551"]}],"id":[{"id":"10.13039\/501100003246","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Amsterdam Data Science"},{"DOI":"10.13039\/100013407","name":"Netherlands eScience Center","doi-asserted-by":"crossref","award":["027.012.105"],"award-info":[{"award-number":["027.012.105"]}],"id":[{"id":"10.13039\/100013407","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Innovation Foundation of NUDT for Postgraduate","award":["B130503"],"award-info":[{"award-number":["B130503"]}]},{"name":"Dutch national program COMMIT"},{"name":"Microsoft Research Ph.D. program"},{"name":"Bloomberg Research Grant program"},{"name":"ESF Research Network Program ELIAS"},{"name":"European Community's Seventh Framework Programme","award":["312827 (VOX-Pol)"],"award-info":[{"award-number":["312827 (VOX-Pol)"]}]},{"name":"Royal Dutch Academy of Sciences (KNAW) under the Elite Network Shifts project"},{"name":"Yahoo Faculty Research and Engagement Program; and Yandex"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Inf. Syst."],"published-print":{"date-parts":[[2016,9,14]]},"abstract":"<jats:p>Query auto-completion assists web search users in formulating queries with a few keystrokes, helping them to avoid spelling mistakes and to produce clear query expressions, and so on. Previous work on query auto-completion mainly centers around returning a list of completions to users, aiming to push queries that are most likely intended by the user to the top positions but ignoring the redundancy among the query candidates in the list. Thus, semantically related queries matching the input prefix are often returned together. This may push valuable suggestions out of the list, given that only a limited number of candidates can be shown to the user, which may result in a less than optimal search experience.<\/jats:p>\n          <jats:p>In this article, we consider the task of diversifying query auto-completion, which aims to return the correct query completions early in a ranked list of candidate completions and at the same time reduce the redundancy among query auto-completion candidates. We develop a greedy query selection approach that predicts query completions based on the current search popularity of candidate completions and on the aspects of previous queries in the same search session. The popularity of completion candidates at query time can be directly aggregated from query logs. However, query aspects are implicitly expressed by previous clicked documents in the search context. To determine the query aspect, we categorize clicked documents of a query using a hierarchy based on the open directory project. Bayesian probabilistic matrix factorization is applied to derive the distribution of queries over all aspects. We quantify the improvement of our greedy query selection model against a state-of-the-art baseline using two large-scale, real-world query logs and show that it beats the baseline in terms of well-known metrics used in query auto-completion and diversification. In addition, we conduct a side-by-side experiment to verify the effectiveness of our proposal.<\/jats:p>","DOI":"10.1145\/2910579","type":"journal-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:54:00Z","timestamp":1465566840000},"page":"1-33","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":37,"title":["Diversifying Query Auto-Completion"],"prefix":"10.1145","volume":"34","author":[{"given":"Fei","family":"Cai","sequence":"first","affiliation":[{"name":"National University of Defense Technology and University of Amsterdam, The Netherlands"}]},{"given":"Ridho","family":"Reinanda","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, The Netherlands"}]},{"given":"Maarten De","family":"Rijke","sequence":"additional","affiliation":[{"name":"University of Amsterdam, Amsterdam, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2016,6,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498766"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487672"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963424"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348312"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242675"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2015.12.008"},{"key":"e_1_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Fei Cai and Maarten de Rijke. 2016b. Query auto completion in information retrieval. Foundations and Trends in Information Retrieval Submitted.  Fei Cai and Maarten de Rijke. 2016b. Query auto completion in information retrieval. Foundations and Trends in Information Retrieval Submitted.","DOI":"10.1561\/9781680832013"},{"key":"e_1_2_1_8_1","volume-title":"SIGIR\u201916. ACM","author":"Cai Fei","unstructured":"Fei Cai and Maarten de Rijke . 2016c. Selectively personalizing query auto-completion . In SIGIR\u201916. ACM , New York, NY , To appear. Fei Cai and Maarten de Rijke. 2016c. Selectively personalizing query auto-completion. In SIGIR\u201916. ACM, New York, NY, To appear."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609453"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661921"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2568179"},{"key":"e_1_2_1_12_1","article-title":"Behavior-based personalization in web search","author":"Cai Fei","year":"2016","unstructured":"Fei Cai , Shuaiqiang Wang , and Maarten de Rijke . 2016 b. Behavior-based personalization in web search . Journal of the Association for Information Science and Technology To appear. Fei Cai, Shuaiqiang Wang, and Maarten de Rijke. 2016b. Behavior-based personalization in web search. Journal of the Association for Information Science and Technology To appear.","journal-title":"Journal of the Association for Information Science and Technology To appear."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.291025"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2094072.2094078"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646033"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148245"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060752"},{"key":"e_1_2_1_18_1","volume-title":"Click Models for Web Search","author":"Chuklin Aleksandr","unstructured":"Aleksandr Chuklin , Ilya Markov , and Maarten de Rijke . 2015. Click Models for Web Search . Morgan & Claypool Publishers , San Francisco, CA . Aleksandr Chuklin, Ilya Markov, and Maarten de Rijke. 2015. Click Models for Web Search. Morgan & Claypool Publishers, San Francisco, CA."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36973-5_1"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390446"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04417-5_17"},{"key":"e_1_2_1_22_1","volume-title":"TREC 2013 Web Track overview. In TREC\u201913","author":"Collins-Thompson Kevyn","unstructured":"Kevyn Collins-Thompson , Paul Bennett , Charles L. A. Clarke , and Ellen M. Voorhees . 2013 . TREC 2013 Web Track overview. In TREC\u201913 . Springer, Berlin, 1--15. Kevyn Collins-Thompson, Paul Bennett, Charles L. A. Clarke, and Ellen M. Voorhees. 2013. TREC 2013 Web Track overview. In TREC\u201913. Springer, Berlin, 1--15."},{"key":"e_1_2_1_23_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms . MIT Press , Cambridge, MA . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms. MIT Press, Cambridge, MA."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484095"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348296"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1977.tb01600.x"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523813"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063619"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.21468"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661922"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.71"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609614"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2505515.2505661"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609467"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767723"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396768"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609571"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609561"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623650"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2036264.2036281"},{"key":"e_1_2_1_44_1","volume-title":"AAAI\u201910","author":"Ma Hao","unstructured":"Hao Ma , Michael R. Lyu , and Irwin King . 2010. Diversifying query suggestion results . In AAAI\u201910 . AAAI Press , New York, NY , 1399--1404. Hao Ma, Michael R. Lyu, and Irwin King. 2010. Diversifying query suggestion results. In AAAI\u201910. AAAI Press, New York, NY, 1399--1404."},{"key":"e_1_2_1_45_1","volume-title":"Proceedings of Workshop at ICLR. MIT Press","author":"Mikolov Tomas","year":"2013","unstructured":"Tomas Mikolov , Kai Chen , Greg S. Corrado , and Jeffrey Dean . 2013 a. Efficient estimation of word representations in vector space . In Proceedings of Workshop at ICLR. MIT Press , Cambridge, MA, 1--13. Tomas Mikolov, Kai Chen, Greg S. Corrado, and Jeffrey Dean. 2013a. Efficient estimation of word representations in vector space. In Proceedings of Workshop at ICLR. MIT Press, Cambridge, MA, 1--13."},{"key":"e_1_2_1_46_1","volume-title":"NIPS 26","author":"Mikolov Tomas","unstructured":"Tomas Mikolov , Ilya Sutskever , Kai Chen , Greg S. Corrado , and Jeffrey Dean . 2013b. Distributed representations of words and phrases and their compositionality . In NIPS 26 . MIT Press , Cambridge, MA , 3111--3119. Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S. Corrado, and Jeffrey Dean. 2013b. Distributed representations of words and phrases and their compositionality. In NIPS 26. MIT Press, Cambridge, MA, 3111--3119."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767702"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2600428.2609508"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146847.1146848"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148320"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390267"},{"key":"e_1_2_1_53_1","volume-title":"NIPS 20","author":"Salakhutdinov Ruslan","unstructured":"Ruslan Salakhutdinov and Andriy Mnih . 2008b. Probabilistic matrix factorization . In NIPS 20 . MIT Press , Cambridge, MA , 1--8. Ruslan Salakhutdinov and Andriy Mnih. 2008b. Probabilistic matrix factorization. In NIPS 20. MIT Press, Cambridge, MA, 1--8."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772780"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871586"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2009997"},{"key":"e_1_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-012-9211-2"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010104"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484028.2484076"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348364"},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010025"},{"key":"e_1_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183632"},{"key":"e_1_2_1_63_1","volume-title":"CIR\u201911 Workshop (SIGIR\u201911)","author":"Vallet David","year":"2011","unstructured":"David Vallet . 2011 . Crowdsourced evaluation of personalization and diversification techniques in web search . In CIR\u201911 Workshop (SIGIR\u201911) . ACM, New York, NY, 1--6. David Vallet. 2011. Crowdsourced evaluation of personalization and diversification techniques in web search. In CIR\u201911 Workshop (SIGIR\u201911). ACM, New York, NY, 1--6."},{"key":"e_1_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/2009916.2010097"},{"key":"e_1_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348396"},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348297"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568009"},{"key":"e_1_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1145\/860435.860440"},{"key":"e_1_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767697"}],"container-title":["ACM Transactions on Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910579","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2910579","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:39:09Z","timestamp":1750221549000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2910579"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,9]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,9,14]]}},"alternative-id":["10.1145\/2910579"],"URL":"https:\/\/doi.org\/10.1145\/2910579","relation":{},"ISSN":["1046-8188","1558-2868"],"issn-type":[{"value":"1046-8188","type":"print"},{"value":"1558-2868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,9]]},"assertion":[{"value":"2015-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}