{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:18:45Z","timestamp":1775283525176,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,24]]},"DOI":"10.1145\/2063576.2063619","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"259-268","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Intent-aware query similarity"],"prefix":"10.1145","author":[{"given":"Jiafeng","family":"Guo","sequence":"first","affiliation":[{"name":"Institute of Computing Technology, CAS, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueqi","family":"Cheng","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, CAS, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gu","family":"Xu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"Zhu","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, CAS, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453903"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30192-9_58"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347176"},{"key":"e_1_3_2_1_4_1","first-page":"585","article-title":"Laplacian eigenmaps and spectral techniques for embedding and clustering","volume":"14","author":"Belkin M.","year":"2001","unstructured":"M. Belkin and P. Niyogi . Laplacian eigenmaps and spectral techniques for embedding and clustering . Advances in Neural Information Processing Systems , 14 : 585 -- 591 , 2001 . M. Belkin and P. Niyogi. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems, 14:585--591, 2001.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143859"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458163"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1507509.1507518"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835536"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458202"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553388"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646108"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1277741.1277784"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1209002"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","author":"Dempster A. P.","year":"1977","unstructured":"A. P. Dempster , N. M. Laird , and D. B. Rubin . Maximum likelihood from incomplete data via the EM algorithm . Journal of the Royal Statistical Society, B(39):1--38 , 1977 . A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, B(39):1--38, 1977.","journal-title":"Journal of the Royal Statistical Society, B(39):1--38"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1572001"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/258525.258597"},{"key":"e_1_3_2_1_18_1","first-page":"537","volume-title":"Advances in Neural Information Processing Systems 17","author":"Griffiths T. L.","year":"2005","unstructured":"T. L. Griffiths , M. Steyvers , D. M. Blei , and J. B. Tenenbaum . Integrating topics and syntax . In In Advances in Neural Information Processing Systems 17 , pages 537 -- 544 . MIT Press , 2005 . T. L. Griffiths, M. Steyvers, D. M. Blei, and J. B. Tenenbaum. Integrating topics and syntax. In In Advances in Neural Information Processing Systems 17, pages 537--544. MIT Press, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871518"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571989"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312649"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135835"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117466"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458177"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1367497.1367512"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1458082.1458145"},{"key":"e_1_3_2_1_27_1","first-page":"355","volume-title":"A view of the EM algorithm that justifies incremental, sparse, and other variants","author":"Neal R. M.","year":"1999","unstructured":"R. M. Neal and G. E. Hinton . A view of the EM algorithm that justifies incremental, sparse, and other variants , pages 355 -- 368 . MIT Press , Cambridge, MA, USA , 1999 . R. M. Neal and G. E. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants, pages 355--368. MIT Press, Cambridge, MA, USA, 1999."},{"key":"e_1_3_2_1_28_1","volume-title":"Numerical recipes in C: the art of scientific computing","author":"Press W. H.","year":"1992","unstructured":"W. H. Press , S. A. Teukolsky , W. T. Vetterling , and B. P. Flannery . Numerical recipes in C: the art of scientific computing . Cambridge University Press , New York, NY, USA , 1992 . W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery. Numerical recipes in C: the art of scientific computing. Cambridge University Press, New York, NY, USA, 1992."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390404"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135834"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014087"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031182"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/503104.503108"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1136004"},{"key":"e_1_3_2_1_35_1","volume-title":"Criterion functions for document clustering: Experiments and analysis. Technical report","author":"Zhao Y.","year":"2002","unstructured":"Y. Zhao and G. Karypis . Criterion functions for document clustering: Experiments and analysis. Technical report , 2002 . Y. Zhao and G. Karypis. Criterion functions for document clustering: Experiments and analysis. Technical report, 2002."}],"event":{"name":"CIKM '11: International Conference on Information and Knowledge Management","location":"Glasgow Scotland, UK","acronym":"CIKM '11","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063619","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:11Z","timestamp":1750240451000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2063576.2063619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":35,"alternative-id":["10.1145\/2063576.2063619","10.1145\/2063576"],"URL":"https:\/\/doi.org\/10.1145\/2063576.2063619","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}