{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:16Z","timestamp":1763468116590,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,11,2]],"date-time":"2012-11-02T00:00:00Z","timestamp":1351814400000},"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":[[2012,11,2]]},"DOI":"10.1145\/2389686.2389703","type":"proceedings-article","created":{"date-parts":[[2012,11,7]],"date-time":"2012-11-07T16:42:56Z","timestamp":1352306576000},"page":"83-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Intent-aware temporal query modeling for keyword suggestion"],"prefix":"10.1145","author":[{"given":"Fredrik","family":"Johansson","sequence":"first","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"F\u00e4rdig","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vinay","family":"Jethava","sequence":"additional","affiliation":[{"name":"Chalmers University of Technology, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetoslav","family":"Marinov","sequence":"additional","affiliation":[{"name":"Findwise AB, Gothenburg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,11,2]]},"reference":[{"volume-title":"Proc. of UAI","year":"2010","author":"Ahmed A.","key":"e_1_3_2_1_1_1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/1390681.1442798"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1699648.1699650"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11880561_9"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30192-9_58"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281204"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348283.2348408"},{"volume-title":"Elsevier","year":"1976","author":"Berge C.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/792550.792552"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401995"},{"key":"e_1_3_2_1_14_1","first-page":"425","volume-title":"ASRU","author":"Celikyilmaz A.","year":"2011"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"issue":"1","key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the em algorithm","volume":"39","author":"Dempster A.","year":"1977","journal-title":"J. Royal Statistical Society, Series B"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1037\/h0031619"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553416"},{"key":"e_1_3_2_1_19_1","unstructured":"G. Ghoshal V. Zlatic G. Caldarelli and M. E. J. Newman. Random hypergraphs and their applications. CoRR abs\/0903.0419 2009. G. Ghoshal V. Zlatic G. Caldarelli and M. E. J. Newman. Random hypergraphs and their applications. CoRR abs\/0903.0419 2009."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063619"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526773"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"V. Jethava C. Bhattacharyya D. Dubhashi and G. N. Vemuri. Netgem: Network embedded temporal generative model for gene expression data. BMC Bioinformatics 12(327) 2011. V. Jethava C. Bhattacharyya D. Dubhashi and G. N. Vemuri. Netgem: Network embedded temporal generative model for gene expression data. BMC Bioinformatics 12(327) 2011.","DOI":"10.1186\/1471-2105-12-327"},{"volume-title":"Chalmers University of Technology","year":"2012","author":"Johansson F.","key":"e_1_3_2_1_23_1"},{"issue":"6","key":"e_1_3_2_1_24_1","first-page":"144","article-title":"Effective approaches for extraction of keywords","volume":"7","author":"Kaur J.","year":"2010","journal-title":"Journal of Computer Science"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"S. Klamt U. Haus and F. Theis. Hypergraphs and cellular networks. PLoS computational biology 5(5):e1000385 2009. S. Klamt U. Haus and F. Theis. Hypergraphs and cellular networks. PLoS computational biology 5(5):e1000385 2009.","DOI":"10.1371\/journal.pcbi.1000385"},{"volume-title":"MIT Press","year":"2009","author":"Koller D.","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935862"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729694"},{"volume-title":"Conf. on Uncertainty in Artificial Intelligence (UAI)","year":"2010","author":"Low Y.","key":"e_1_3_2_1_29_1"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5014-9_12"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187918"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988675"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772776"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp192"},{"key":"e_1_3_2_1_36_1","article-title":"Potential for personalization","author":"Teevan J.","year":"2010","journal-title":"ACM Trans. on Computer"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390364"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000001"}],"event":{"name":"CIKM'12: 21st ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Maui Hawaii USA","acronym":"CIKM'12"},"container-title":["Proceedings of the 5th Ph.D. workshop on Information and knowledge"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2389686.2389703","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2389686.2389703","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:59Z","timestamp":1750239299000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2389686.2389703"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,2]]},"references-count":37,"alternative-id":["10.1145\/2389686.2389703","10.1145\/2389686"],"URL":"https:\/\/doi.org\/10.1145\/2389686.2389703","relation":{},"subject":[],"published":{"date-parts":[[2012,11,2]]},"assertion":[{"value":"2012-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}