{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T04:41:37Z","timestamp":1664512897875},"reference-count":38,"publisher":"Walter de Gruyter GmbH","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Query auto-completion helps users to formulate their information needs by providing suggestion lists at every typed key. This task is commonly addressed by exploiting query logs and the approaches proposed in the literature fit well in web scale scenarios, where usually huge amounts of past user queries can be analyzed to provide reliable suggestions. However, when query logs are not available, e.g. in enterprise or desktop search engines, these methods are not applicable at all. To face these challenging scenarios, we present a novel corpus-based approach which exploits the textual content of an indexed document collection in order to dynamically generate query completions. Our method extracts informative text fragments from the corpus and it combines them using a probabilistic graphical model in order to capture the relationships between the extracted concepts. Using this approach, it is possible to automatically complete partial queries with significant suggestions related to the keywords already entered by the user without requiring the analysis of the past queries. We evaluate our system through a user study on two different real-world document collections. The experiments show that our method is able to provide meaningful completions outperforming the state-of-the art approach.<\/jats:p>","DOI":"10.1515\/comp-2019-0015","type":"journal-article","created":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T09:18:52Z","timestamp":1569057532000},"page":"212-225","source":"Crossref","is-referenced-by-count":2,"title":["Modeling concepts and their relationships for corpus-based query auto-completion"],"prefix":"10.1515","volume":"9","author":[{"given":"Gaetano","family":"Rossiello","sequence":"first","affiliation":[{"name":"IBM Research AI, Thomas J. Watson Research Center , Yorktown Heights, NY, USA ."}]},{"given":"Annalina","family":"Caputo","sequence":"additional","affiliation":[{"name":"ADAPT centre, School of Computer Science and Statistics , Trinity College Dublin , Ireland ."}]},{"given":"Pierpaolo","family":"Basile","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Bari Aldo Moro , Bari , Italy ."}]},{"given":"Giovanni","family":"Semeraro","sequence":"additional","affiliation":[{"name":"Department of Computer Science , University of Bari Aldo Moro , Bari , Italy ."}]}],"member":"374","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"key":"2022042707443483656_j_comp-2019-0015_ref_001_w2aab3b7c14b1b6b1ab1ab1Aa","doi-asserted-by":"crossref","unstructured":"[1] Fabrizio Silvestri. Mining query logs: Turning search usage data into knowledge. Foundations and Trends in Information Retrieval, 4(1\u20132):1\u2013174, 2010.","DOI":"10.1561\/1500000013"},{"key":"2022042707443483656_j_comp-2019-0015_ref_002_w2aab3b7c14b1b6b1ab1ab2Aa","doi-asserted-by":"crossref","unstructured":"[2] Fei Cai and Maarten de Rijke. A survey of query auto completion in information retrieval. Foundations and Trends in Information Retrieval, 10(4):273\u2013363, 2016.10.1561\/1500000055","DOI":"10.1561\/1500000055"},{"key":"2022042707443483656_j_comp-2019-0015_ref_003_w2aab3b7c14b1b6b1ab1ab3Aa","doi-asserted-by":"crossref","unstructured":"[3] Sumit Bhatia, Debapriyo Majumdar, and Prasenjit Mitra. Query suggestions in the absence of query logs. In Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval, pages 795\u2013804. ACM, 2011.10.1145\/2009916.2010023","DOI":"10.1145\/2009916.2010023"},{"key":"2022042707443483656_j_comp-2019-0015_ref_004_w2aab3b7c14b1b6b1ab1ab4Aa","doi-asserted-by":"crossref","unstructured":"[4] P Deepak, Sutanu Chakraborti, and Deepak Khemani. Query suggestions for textual problem solution repositories. In ECIR, pages 569\u2013581. 2013.10.1007\/978-3-642-36973-5_48","DOI":"10.1007\/978-3-642-36973-5_48"},{"key":"2022042707443483656_j_comp-2019-0015_ref_005_w2aab3b7c14b1b6b1ab1ab5Aa","doi-asserted-by":"crossref","unstructured":"[5] Michael Bendersky and W Bruce Croft. Modeling higher-order term dependencies in information retrieval using query hyper-graphs. In Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval, pages 941\u2013950. ACM, 2012.10.1145\/2348283.2348408","DOI":"10.1145\/2348283.2348408"},{"key":"2022042707443483656_j_comp-2019-0015_ref_006_w2aab3b7c14b1b6b1ab1ab6Aa","doi-asserted-by":"crossref","unstructured":"[6] Catherine L Smith, Jacek Gwizdka, and Henry Feild. The use of query auto-completion over the course of search sessions with multifaceted information needs. Information Processing & Management, 53(5):1139\u20131155, 2017.10.1016\/j.ipm.2017.05.001","DOI":"10.1016\/j.ipm.2017.05.001"},{"key":"2022042707443483656_j_comp-2019-0015_ref_007_w2aab3b7c14b1b6b1ab1ab7Aa","doi-asserted-by":"crossref","unstructured":"[7] Xi Niu and Diane Kelly. The use of query suggestions during information search. Information Processing & Management, 50(1):218\u2013234, 2014.10.1016\/j.ipm.2013.09.002","DOI":"10.1016\/j.ipm.2013.09.002"},{"key":"2022042707443483656_j_comp-2019-0015_ref_008_w2aab3b7c14b1b6b1ab1ab8Aa","doi-asserted-by":"crossref","unstructured":"[8] Diane Kelly, Amber Cushing, Maureen Dostert, Xi Niu, and Karl Gyllstrom. Effects of popularity and quality on the usage of query suggestions during information search. In Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pages 45\u201354. ACM, 2010.10.1145\/1753326.1753334","DOI":"10.1145\/1753326.1753334"},{"key":"2022042707443483656_j_comp-2019-0015_ref_009_w2aab3b7c14b1b6b1ab1ab9Aa","doi-asserted-by":"crossref","unstructured":"[9] Ricardo Baeza-Yates, Carlos Hurtado, and Marcelo Mendoza. Query recommendation using query logs in search engines. In Proceedings of the 2004 International Conference on Current Trends in Database Technology, pages 588\u2013596, 2004.10.1007\/978-3-540-30192-9_58","DOI":"10.1007\/978-3-540-30192-9_58"},{"key":"2022042707443483656_j_comp-2019-0015_ref_010_w2aab3b7c14b1b6b1ab1ac10Aa","doi-asserted-by":"crossref","unstructured":"[10] Rosie Jones, Benjamin Rey, Omid Madani, and Wiley Greiner. Generating query substitutions. In Proceedings of the 15th international conference on World Wide Web, pages 387\u2013396. ACM, 2006.10.1145\/1135777.1135835","DOI":"10.1145\/1135777.1135835"},{"key":"2022042707443483656_j_comp-2019-0015_ref_011_w2aab3b7c14b1b6b1ab1ac11Aa","doi-asserted-by":"crossref","unstructured":"[11] M. Barouni-Ebrahimi and Ali A. Ghorbani. A novel approach for frequent phrase mining in web search engine query streams. In CNSR, pages 125\u2013132. IEEE Computer Society, 2007.10.1109\/CNSR.2007.5","DOI":"10.1109\/CNSR.2007.5"},{"key":"2022042707443483656_j_comp-2019-0015_ref_012_w2aab3b7c14b1b6b1ab1ac12Aa","unstructured":"[12] Yanan Li, Bin Wang, Sheng Xu, Peng Li, and Jintao Li. Query-trans: Finding similar queries based on query trace graph. In Web Intelligence, pages 260\u2013263. IEEE, 2009."},{"key":"2022042707443483656_j_comp-2019-0015_ref_013_w2aab3b7c14b1b6b1ab1ac13Aa","doi-asserted-by":"crossref","unstructured":"[13] Yang Song and Li-wei He. Optimal rare query suggestion with implicit user feedback. In Proceedings of the 19th international conference on World wide web, pages 901\u2013910. ACM, 2010.10.1145\/1772690.1772782","DOI":"10.1145\/1772690.1772782"},{"key":"2022042707443483656_j_comp-2019-0015_ref_014_w2aab3b7c14b1b6b1ab1ac14Aa","doi-asserted-by":"crossref","unstructured":"[14] Ziv Bar-Yossef and Naama Kraus. Context-sensitive query auto-completion. In Proceedings of the 20th international conference on World wide web, pages 107\u2013116. ACM, 2011.10.1145\/1963405.1963424","DOI":"10.1145\/1963405.1963424"},{"key":"2022042707443483656_j_comp-2019-0015_ref_015_w2aab3b7c14b1b6b1ab1ac15Aa","doi-asserted-by":"crossref","unstructured":"[15] Hao Ma, Haixuan Yang, Irwin King, and Michael R Lyu. Learning latent semantic relations from clickthrough data for query suggestion. In Proceedings of the 17th ACM conference on Information and knowledge management, pages 709\u2013718. ACM, 2008.10.1145\/1458082.1458177","DOI":"10.1145\/1458082.1458177"},{"key":"2022042707443483656_j_comp-2019-0015_ref_016_w2aab3b7c14b1b6b1ab1ac16Aa","unstructured":"[16] Huanhuan Cao, Daxin Jiang, Jian Pei, Qi He, Zhen Liao, Enhong Chen, and Hang Li. Context-aware query suggestion by mining click-through and session data. In Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 875\u2013883. ACM, 2008."},{"key":"2022042707443483656_j_comp-2019-0015_ref_017_w2aab3b7c14b1b6b1ab1ac17Aa","doi-asserted-by":"crossref","unstructured":"[17] Eugene Kharitonov, Craig Macdonald, Pavel Serdyukov, and Iadh Ounis. Intent models for contextualising and diversifying query suggestions. In Proceedings of the 22nd ACM international conference on Conference on information & knowledge management, pages 2303\u20132308. ACM, 2013.10.1145\/2505515.2505661","DOI":"10.1145\/2505515.2505661"},{"key":"2022042707443483656_j_comp-2019-0015_ref_018_w2aab3b7c14b1b6b1ab1ac18Aa","doi-asserted-by":"crossref","unstructured":"[18] F. Cai, S. Liang, and M. de Rijke. Prefix-Adaptive and Time-Sensitive Personalized Query Auto Completion. IEEE Transactions on Knowledge and Data Engineering, 28(9):2452\u20132466, 2016.10.1109\/TKDE.2016.2568179","DOI":"10.1109\/TKDE.2016.2568179"},{"key":"2022042707443483656_j_comp-2019-0015_ref_019_w2aab3b7c14b1b6b1ab1ac19Aa","doi-asserted-by":"crossref","unstructured":"[19] Fei Cai, Ridho Reinanda, and Maarten De Rijke. Diversifying Query Auto-Completion. ACM Transactions on Information Systems, 34(4):25:1\u201325:33, June 2016.10.1145\/2910579","DOI":"10.1145\/2910579"},{"key":"2022042707443483656_j_comp-2019-0015_ref_020_w2aab3b7c14b1b6b1ab1ac20Aa","doi-asserted-by":"crossref","unstructured":"[20] Liangda Li, Hongbo Deng, Jianhui Chen, and Yi Chang. Learning parametric models for context-aware query auto-completion via hawkes processes. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining, WSDM \u201917, pages 131\u2013139, New York, NY, USA, 2017. ACM.10.1145\/3018661.3018698","DOI":"10.1145\/3018661.3018698"},{"key":"2022042707443483656_j_comp-2019-0015_ref_021_w2aab3b7c14b1b6b1ab1ac21Aa","doi-asserted-by":"crossref","unstructured":"[21] Bhaskar Mitra. Exploring session context using distributed representations of queries and reformulations. In Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, pages 3\u201312. ACM, 2015.10.1145\/2766462.2767702","DOI":"10.1145\/2766462.2767702"},{"key":"2022042707443483656_j_comp-2019-0015_ref_022_w2aab3b7c14b1b6b1ab1ac22Aa","doi-asserted-by":"crossref","unstructured":"[22] Bhaskar Mitra and Nick Craswell. Query auto-completion for rare prefixes. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management, pages 1755\u20131758. ACM, 2015.10.1145\/2806416.2806599","DOI":"10.1145\/2806416.2806599"},{"key":"2022042707443483656_j_comp-2019-0015_ref_023_w2aab3b7c14b1b6b1ab1ac23Aa","doi-asserted-by":"crossref","unstructured":"[23] Milad Shokouhi. Learning to personalize query auto-completion. In Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval, pages 103\u2013112. ACM, 2013.10.1145\/2484028.2484076","DOI":"10.1145\/2484028.2484076"},{"key":"2022042707443483656_j_comp-2019-0015_ref_024_w2aab3b7c14b1b6b1ab1ac24Aa","doi-asserted-by":"crossref","unstructured":"[24] Fei Cai and Maarten de Rijke. Learning from homologous queries and semantically related terms for query auto completion. Information Processing & Management, 52(4):628\u2013643, 2016.10.1016\/j.ipm.2015.12.008","DOI":"10.1016\/j.ipm.2015.12.008"},{"key":"2022042707443483656_j_comp-2019-0015_ref_025_w2aab3b7c14b1b6b1ab1ac25Aa","doi-asserted-by":"crossref","unstructured":"[25] Giovanni Di Santo, Richard McCreadie, Craig Macdonald, and Iadh Ounis. Comparing approaches for query autocompletion. In Ricardo A. Baeza-Yates, Mounia Lalmas, Alistair Moffat, and Berthier A. Ribeiro-Neto, editors, Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, Santiago, Chile, August 9-13, 2015, pages 775\u2013778. ACM, 2015.10.1145\/2766462.2767829","DOI":"10.1145\/2766462.2767829"},{"key":"2022042707443483656_j_comp-2019-0015_ref_026_w2aab3b7c14b1b6b1ab1ac26Aa","doi-asserted-by":"crossref","unstructured":"[26] Holger Bast and Ingmar Weber. Type less, find more: fast autocompletion search with a succinct index. In Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval, pages 364\u2013371. ACM, 2006.10.1145\/1148170.1148234","DOI":"10.1145\/1148170.1148234"},{"key":"2022042707443483656_j_comp-2019-0015_ref_027_w2aab3b7c14b1b6b1ab1ac27Aa","doi-asserted-by":"crossref","unstructured":"[27] David Maxwell, Peter Bailey, and David Hawking. Large-scale generative query autocompletion. In Bevan Koopman, Guido Zuccon, and Mark James Carman, editors, Proceedings of the 22nd Australasian Document Computing Symposium, ADCS 2017, Brisbane, QLD, Australia, December 7-8, 2017, pages 9:1\u20139:8. ACM, 2017.10.1145\/3166072.3166083","DOI":"10.1145\/3166072.3166083"},{"key":"2022042707443483656_j_comp-2019-0015_ref_028_w2aab3b7c14b1b6b1ab1ac28Aa","doi-asserted-by":"crossref","unstructured":"[28] Meher T. Shaikh, Maria Soledad Pera, and Yiu-Kai Ng. A probabilistic query suggestion approach without using query logs. In 25th International Conference on Tools with Artificial Intelligence, pages 633\u2013639. IEEE Computer Society, 2013.10.1109\/ICTAI.2013.99","DOI":"10.1109\/ICTAI.2013.99"},{"key":"2022042707443483656_j_comp-2019-0015_ref_029_w2aab3b7c14b1b6b1ab1ac29Aa","doi-asserted-by":"crossref","unstructured":"[29] Youngho Kim, Jangwon Seo, W. Bruce Croft, and David A. Smith. Automatic suggestion of phrasal-concept queries for literature search. Information Processing and Management, 50(4):568\u2013583, 2014.10.1016\/j.ipm.2014.03.003","DOI":"10.1016\/j.ipm.2014.03.003"},{"key":"2022042707443483656_j_comp-2019-0015_ref_030_w2aab3b7c14b1b6b1ab1ac30Aa","unstructured":"[30] Rafal J\u00f3zefowicz, Oriol Vinyals, Mike Schuster, Noam Shazeer, and Yonghui Wu. Exploring the limits of language modeling. CoRR, abs\/1602.02410, 2016."},{"key":"2022042707443483656_j_comp-2019-0015_ref_031_w2aab3b7c14b1b6b1ab1ac31Aa","doi-asserted-by":"crossref","unstructured":"[31] Chengxiang Zhai and John Lafferty. A study of smoothing methods for language models applied to information retrieval. ACM Transactions on Information Systems, 22(2):179\u2013214, April 2004.10.1145\/984321.984322","DOI":"10.1145\/984321.984322"},{"key":"2022042707443483656_j_comp-2019-0015_ref_032_w2aab3b7c14b1b6b1ab1ac32Aa","doi-asserted-by":"crossref","unstructured":"[32] F. R. Kschischang, B. J. Frey, and H. A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory, 47(2):498\u2013519, 2006.10.1109\/18.910572","DOI":"10.1109\/18.910572"},{"key":"2022042707443483656_j_comp-2019-0015_ref_033_w2aab3b7c14b1b6b1ab1ac33Aa","doi-asserted-by":"crossref","unstructured":"[33] David J.C. MacKay and Linda C. Bauman Peto. A hierarchical dirichlet language model. Natural Language Engineering, 1:1\u201319, 1994.10.1017\/S1351324900000218","DOI":"10.1017\/S1351324900000218"},{"key":"2022042707443483656_j_comp-2019-0015_ref_034_w2aab3b7c14b1b6b1ab1ac34Aa","doi-asserted-by":"crossref","unstructured":"[34] Mark D Smucker, James Allan, and Ben Carterette. A comparison of statistical significance tests for information retrieval evaluation. In Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, pages 623\u2013632. ACM, 2007.10.1145\/1321440.1321528","DOI":"10.1145\/1321440.1321528"},{"key":"2022042707443483656_j_comp-2019-0015_ref_035_w2aab3b7c14b1b6b1ab1ac35Aa","unstructured":"[35] Yuanhua Lv and ChengXiang Zhai. Positional language models for information retrieval. In Proceedings of the 32Nd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR \u201909, pages 299\u2013306, New York, NY, USA, 2009. ACM."},{"key":"2022042707443483656_j_comp-2019-0015_ref_036_w2aab3b7c14b1b6b1ab1ac36Aa","doi-asserted-by":"crossref","unstructured":"[36] Sumit Bhatia and Prasenjit Mitra. Adopting inference networks for online thread retrieval. In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, pages 1300\u20131305, Atlanta, Georgia, USA, July 11-15 2010.","DOI":"10.1609\/aaai.v24i1.7521"},{"key":"2022042707443483656_j_comp-2019-0015_ref_037_w2aab3b7c14b1b6b1ab1ac37Aa","doi-asserted-by":"crossref","unstructured":"[37] Yann Lecun, Yoshua Bengio, and Geoffrey Hinton. Deep learning. Nature, 521(7553):436\u2013444, 5 2015.10.1038\/nature14539","DOI":"10.1038\/nature14539"},{"key":"2022042707443483656_j_comp-2019-0015_ref_038_w2aab3b7c14b1b6b1ab1ac38Aa","doi-asserted-by":"crossref","unstructured":"[38] Yoshua Bengio, Aaron Courville, and Pascal Vincent. Representation learning: A review and new perspectives. IEEE Transactions on Pattern Analysis and Machine Intelligence, 35(8):1798\u20131828, August 2013.10.1109\/TPAMI.2013.50","DOI":"10.1109\/TPAMI.2013.50"}],"container-title":["Open Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.degruyter.com\/view\/journals\/comp\/9\/1\/article-p212.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2019-0015\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2019-0015\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T06:01:45Z","timestamp":1664431305000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/comp-2019-0015\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":38,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2019,9,26]]},"published-print":{"date-parts":[[2019,1,1]]}},"alternative-id":["10.1515\/comp-2019-0015"],"URL":"https:\/\/doi.org\/10.1515\/comp-2019-0015","relation":{},"ISSN":["2299-1093"],"issn-type":[{"value":"2299-1093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}