{"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":1775283524277,"version":"3.50.1"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61073110"],"award-info":[{"award-number":["61073110"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People's Republic of China","doi-asserted-by":"publisher","award":["2.01E+13"],"award-info":[{"award-number":["2.01E+13"]}],"id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>\n            Query suggestion plays an important role in improving usability of search engines. Although some recently proposed methods provide query suggestions by mining query patterns from search logs, none of them models the immediately preceding queries as context systematically, and uses context information effectively in query suggestions. Context-aware query suggestion is challenging in both modeling context and scaling up query suggestion using context. In this article, we propose a novel context-aware query suggestion approach. To tackle the challenges, our approach consists of two stages. In the first,\n            <jats:italic>offline model-learning stage<\/jats:italic>\n            , to address data sparseness, queries are summarized into concepts by clustering a click-through bipartite. A\n            <jats:italic>concept sequence suffix tree<\/jats:italic>\n            is then constructed from session data as a context-aware query suggestion model. In the second,\n            <jats:italic>online query suggestion stage<\/jats:italic>\n            , a user\u2019s search context is captured by mapping the query sequence submitted by the user to a sequence of concepts. By looking up the context in the concept sequence suffix tree, we suggest to the user context-aware queries. We test our approach on large-scale search logs of a commercial search engine containing 4.0 billion Web queries, 5.9 billion clicks, and 1.87 billion search sessions. The experimental results clearly show that our approach outperforms three baseline methods in both coverage and quality of suggestions.\n          <\/jats:p>","DOI":"10.1145\/2036264.2036281","type":"journal-article","created":{"date-parts":[[2012,10,12]],"date-time":"2012-10-12T20:56:02Z","timestamp":1350075362000},"page":"1-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Mining Concept Sequences from Large-Scale Search Logs for Context-Aware Query Suggestion"],"prefix":"10.1145","volume":"3","author":[{"given":"Zhen","family":"Liao","sequence":"first","affiliation":[{"name":"Nankai University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daxin","family":"Jiang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enhong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huanhuan","family":"Cao","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hang","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718508"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281204"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30192-9_58"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347176"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1089\/106652799318274"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509.1507518"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458163"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390377"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401995"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277746"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277784"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511489"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI\u201904)","author":"Dean J.","unstructured":"Dean , J. and Ghemawat , S . 2004. MapReduce: simplified data processing on large clusters . In Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI\u201904) . 137--150. Dean, J. and Ghemawat, S. 2004. MapReduce: simplified data processing on large clusters. In Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI\u201904). 137--150."},{"key":"e_1_2_1_14_1","volume-title":"Proceedings of the 2nd International Conference on KDD. 226--231","author":"Ester M.","unstructured":"Ester , M. , Kriegel , H. , Sander , J. , and Xu , X . 1996. A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the 2nd International Conference on KDD. 226--231 . Ester, M., Kriegel, H., Sander, J., and Xu, X. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on KDD. 226--231."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099726"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572003"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390400"},{"key":"e_1_2_1_18_1","volume-title":"Proceedings of the 25th International Conference on Very Large Data Bases (VLDB\u201999)","author":"Hinneburg A.","unstructured":"Hinneburg A. and Keim , D. A . 1999. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering . In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB\u201999) . 506--517. Hinneburg A. and Keim, D. A. 1999. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. In Proceedings of the 25th International Conference on Very Large Data Bases (VLDB\u201999). 506--517."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10256"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/281250.281253"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11766254_16"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135835"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988763"},{"key":"e_1_2_1_24_1","volume-title":"Proceedings of the 7th International Conference on User Modeling. 119--128","author":"Lau T.","unstructured":"Lau , T. and Horvitz , E . 1999. Patterns of search: Analyzing and modeling web query refinement . In Proceedings of the 7th International Conference on User Modeling. 119--128 . Lau, T. and Horvitz, E. 1999. Patterns of search: Analyzing and modeling web query refinement. In Proceedings of the 7th International Conference on User Modeling. 119--128."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/383952.383972"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008992.1009039"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/258525.258603"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646284"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458145"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277796"},{"key":"e_1_2_1_31_1","volume-title":"Proceedings of the International Conference on Data Engineering (ICDE\u201901)","author":"Pei J.","unstructured":"Pei , J. , Han , J. , Mortazavi-Asl , B. , Pinto , H. , Chen , Q. , Dayal , U. , and Hsu , M . -C. 2001. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth . In Proceedings of the International Conference on Data Engineering (ICDE\u201901) . 215--224. Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., and Hsu, M.-C. 2001. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In Proceedings of the International Conference on Data Engineering (ICDE\u201901). 215--224."},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of ASIS&T Annual Meeting. 246--255","author":"Rieh S. Y.","unstructured":"Rieh , S. Y. and Xie , H . 2001. Patterns and sequences of multiple query reformulations in web searching: A preliminary study . In Proceedings of ASIS&T Annual Meeting. 246--255 . Rieh, S. Y. and Xie, H. 2001. Patterns and sequences of multiple query reformulations in web searching: A preliminary study. In Proceedings of ASIS&T Annual Meeting. 246--255."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772776"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135834"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/331403.331405"},{"key":"e_1_2_1_37_1","volume-title":"Proceedings of the 5th International Conference of Extending Database Technology (EDBT\u201996)","author":"Srikant R.","unstructured":"Srikant , R. and Agrawal , R . 1996. Mining sequential patterns: Generalizations and performance improvements . In Proceedings of the 5th International Conference of Extending Database Technology (EDBT\u201996) . 3--17. Srikant, R. and Agrawal, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the 5th International Conference of Extending Database Technology (EDBT\u201996). 3--17."},{"key":"e_1_2_1_38_1","unstructured":"Tan P. N. Steinbach M. and Kumar V. 2005. Introduction to Data Mining 1st Ed. Addison-Wesley Longman Publishing Co. Inc. Tan P. N. Steinbach M. and Kumar V. 2005. Introduction to Data Mining 1st Ed. Addison-Wesley Longman Publishing Co. Inc."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031182"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.371974"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572005"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871565"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277771"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233324"}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2036264.2036281","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2036264.2036281","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:29Z","timestamp":1750240109000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2036264.2036281"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.1145\/2036264.2036281"],"URL":"https:\/\/doi.org\/10.1145\/2036264.2036281","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"value":"2157-6904","type":"print"},{"value":"2157-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]},"assertion":[{"value":"2010-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2011-10-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}