{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:54Z","timestamp":1750306794642,"version":"3.41.0"},"reference-count":52,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T00:00:00Z","timestamp":1380585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61105049"],"award-info":[{"award-number":["61105049"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006112","name":"Microsoft Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006112","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BCFRST NRAS Endowment Research Team Program project"},{"DOI":"10.13039\/501100000161","name":"Networks of Centres of Excellence of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000161","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Web"],"published-print":{"date-parts":[[2013,10]]},"abstract":"<jats:p>Capturing the context of a user's query from the previous queries and clicks in the same session leads to a better understanding of the user's information need. A context-aware approach to document reranking, URL recommendation, and query suggestion may substantially improve users' search experience. In this article, we propose a general approach to context-aware search by learning a<jats:italic>variable length hidden Markov model<\/jats:italic>(<jats:italic>vlHMM<\/jats:italic>) from search sessions extracted from log data. While the mathematical model is powerful, the huge amounts of log data present great challenges. We develop several distributed learning techniques to learn a very large vlHMM under the<jats:italic>map-reduce<\/jats:italic>framework. Moreover, we construct feature vectors for each state of the vlHMM model to handle users' novel queries not covered by the training data. We test our approach on a raw dataset consisting of 1.9 billion queries, 2.9 billion clicks, and 1.2 billion search sessions before filtering, and evaluate the effectiveness of the vlHMM learned from the real data on three search applications: document reranking, query suggestion, and URL recommendation. The experiment results validate the effectiveness of vlHMM in the applications of document reranking, URL recommendation, and query suggestion.<\/jats:p>","DOI":"10.1145\/2490255","type":"journal-article","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T14:09:19Z","timestamp":1383746959000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["A vlHMM approach to context-aware search"],"prefix":"10.1145","volume":"7","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":"Jian","family":"Pei","sequence":"additional","affiliation":[{"name":"Simon Fraser University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yalou","family":"Huang","sequence":"additional","affiliation":[{"name":"Nankai University"}],"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":"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":"Huawei Noah's Ark Lab"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,11]]},"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.1214\/aoms\/1177697196"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347176"},{"volume-title":"A gentle tutorial of the EM algorithm and its application to parameter estimation for gaussian mixture and hidden markov models. Tech. rep","author":"Bilmes J.","key":"e_1_2_1_6_1","unstructured":"Bilmes , J. 1998. A gentle tutorial of the EM algorithm and its application to parameter estimation for gaussian mixture and hidden markov models. Tech. rep . Intetrnational Computer Science Institute , Berkley, CA . Bilmes, J. 1998. A gentle tutorial of the EM algorithm and its application to parameter estimation for gaussian mixture and hidden markov models. Tech. rep. Intetrnational Computer Science Institute, Berkley, CA."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509.1507518"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458163"},{"key":"e_1_2_1_9_1","unstructured":"Borda J. C. 1781. M\u00e9moire sur les \u00e9lections au scrution. Histoire de l'Acad\u00e9mie Royal des Sciences. Borda J. C. 1781. M\u00e9moire sur les \u00e9lections au scrution. Histoire de l'Acad\u00e9mie Royal des Sciences."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526736"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401995"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526711"},{"volume-title":"Proceedings of the 20th Annual Conference on Neural Information Processing Systems (NIPS'06)","author":"Chu C.-T.","key":"e_1_2_1_13_1","unstructured":"Chu , C.-T. , Kim , S. K. , Lin , Y.-A. , Yn , Y. , Bradski , G. , Ng , A. Y. , and Olukotun , K . 2006. Map-reduce for machine learning on multicore . In Proceedings of the 20th Annual Conference on Neural Information Processing Systems (NIPS'06) . MIT Press, Combridge, MA, 281--288. Chu, C.-T., Kim, S. K., Lin, Y.-A., Yn, Y., Bradski, G., Ng, A. Y., and Olukotun, K. 2006. Map-reduce for machine learning on multicore. In Proceedings of the 20th Annual Conference on Neural Information Processing Systems (NIPS'06). MIT Press, Combridge, MA, 281--288."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277784"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341545"},{"volume-title":"Proceedings of the 6th Symposium on Operating System Design and Implementation (OSDI'04)","author":"Dean J.","key":"e_1_2_1_16_1","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'04) . USENIX Association, Berkeley, CA. 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'04). USENIX Association, Berkeley, CA."},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximal likelihood from incomplete data via the EM algorithm","volume":"39","author":"Dempster A. P.","year":"1977","unstructured":"Dempster , A. P. , Laird , N. M. , and Rubin , D. B. 1977 . Maximal likelihood from incomplete data via the EM algorithm . J. Royal Stat. Soci. Ser B , 39 , 1 -- 38 . Dempster, A. P., Laird, N. M., and Rubin, D. B. 1977. Maximal likelihood from incomplete data via the EM algorithm. J. Royal Stat. Soci. Ser B, 39, 1--38.","journal-title":"J. Royal Stat. Soci. Ser B"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572001"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772724"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390392"},{"key":"e_1_2_1_21_1","doi-asserted-by":"crossref","unstructured":"Durbin R. Eddy S. R. Krogh A. and Mitchison G. 1999. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press Cambridge U.K. Durbin R. Eddy S. R. Krogh A. and Mitchison G. 1999. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press Cambridge U.K.","DOI":"10.1017\/CBO9780511790492"},{"volume-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD). 226--231","author":"Ester M.","key":"e_1_2_1_22_1","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 Knowledge Discovery and Data Mining (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 Knowledge Discovery and Data Mining (KDD). 226--231."},{"volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03)","author":"Fagin R.","key":"e_1_2_1_23_1","unstructured":"Fagin , R. , Kumar , R. , and Sivakumar , D . 2003. Comparing top k lists . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03) . Society for Industrial and Applied Mathematics, Philadelphia, PA, 28--36. Fagin, R., Kumar, R., and Sivakumar, D. 2003. Comparing top k lists. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03). Society for Industrial and Applied Mathematics, Philadelphia, PA, 28--36."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1099554.1099726"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1059981.1059982"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572003"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498759.1498818"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718515"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10256"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/11766254_16"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775067"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076063"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458176"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135835"},{"volume-title":"Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'05)","author":"Kotov A.","key":"e_1_2_1_35_1","unstructured":"Kotov , A. , Bennett , P. , White , R. , Dumais , S. , and Teevan , J . 2005. Modeling and analysis of cross-session search tasks . In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'05) . Kotov, A., Bennett, P., White, R., Dumais, S., and Teevan, J. 2005. Modeling and analysis of cross-session search tasks. In Proceedings of the 28th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR'05)."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2036264.2036281"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187903"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935875"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646284"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458145"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/5.18626"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081899"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772776"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1076034.1076045"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.70"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.105"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.371974"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572005"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871565"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277771"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835525"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/11880592_3"}],"container-title":["ACM Transactions on the Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2490255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2490255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:33Z","timestamp":1750232073000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2490255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["10.1145\/2490255"],"URL":"https:\/\/doi.org\/10.1145\/2490255","relation":{},"ISSN":["1559-1131","1559-114X"],"issn-type":[{"type":"print","value":"1559-1131"},{"type":"electronic","value":"1559-114X"}],"subject":[],"published":{"date-parts":[[2013,10]]},"assertion":[{"value":"2011-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-11-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}