{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T07:01:05Z","timestamp":1775199665063,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,10,21]],"date-time":"2013-10-21T00:00:00Z","timestamp":1382313600000},"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":[[2013,10,21]]},"DOI":"10.1145\/2502081.2502283","type":"proceedings-article","created":{"date-parts":[[2013,10,22]],"date-time":"2013-10-22T13:42:56Z","timestamp":1382449376000},"page":"243-252","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["Clickage"],"prefix":"10.1145","author":[{"given":"Xian-Sheng","family":"Hua","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Linjun","family":"Yang","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingdong","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jing","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Ye","sequence":"additional","affiliation":[{"name":"Microsoft Corporation, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuansan","family":"Wang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yong","family":"Rui","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin","family":"Li","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,10,21]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Image retrieval in clef http:\/\/imageclef.org\/2012\/photo-web.  Image retrieval in clef http:\/\/imageclef.org\/2012\/photo-web."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273501"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118694"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2009.5206848"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1013203451"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2008.916338"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963447"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/582415.582418"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1126004.1126005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2009.2030598"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526757"},{"key":"e_1_3_2_1_15_1","first-page":"1231","volume-title":"NIPS","author":"Mann G.","year":"2009","unstructured":"G. Mann , R. T. McDonald , M. Mohri , N. Silberman , and D. Walker . Efficient large-scale distributed training of conditional maximum entropy models . In NIPS , pages 1231 -- 1239 , 2009 . G. Mann, R. T. McDonald, M. Mohri, N. Silberman, and D. Walker. Efficient large-scale distributed training of conditional maximum entropy models. In NIPS, pages 1231--1239, 2009."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0420-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/791220.791680"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2008.128"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2050290"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2001.990517"},{"key":"e_1_3_2_1_21_1","first-page":"91","volume-title":"AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors","author":"von Ahn L.","year":"2005","unstructured":"L. von Ahn and L. Dabbish . Esp: Labeling images with a computer game . In AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors , pages 91 -- 98 , 2005 . L. von Ahn and L. Dabbish. Esp: Labeling images with a computer game. In AAAI Spring Symposium: Knowledge Collection from Volunteer Contributors, pages 91--98, 2005."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2393347.2396466"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2354409.2354854"},{"key":"e_1_3_2_1_24_1","first-page":"21","volume-title":"ICASSP","author":"Yan R.","year":"2003","unstructured":"R. Yan , Y. Liu , R. Jin , and A. Hauptmann . On predicting rare classes with svm ensembles in scene classification . In ICASSP , pages 21 -- 24 , 2003 . R. Yan, Y. Liu, R. Jin, and A. Hauptmann. On predicting rare classes with svm ensembles in scene classification. In ICASSP, pages 21--24, 2003."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2006.247"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1823746.1823747"},{"key":"e_1_3_2_1_27_1","first-page":"1159","volume-title":"ACL","author":"Zhang F.","year":"2011","unstructured":"F. Zhang , S. Shi , J. Liu , S. Sun , and C.-Y. Lin . Nonlinear evidence fusion and propagation for hyponymy relation mining . In ACL , pages 1159 -- 1168 , 2011 . F. Zhang, S. Shi, J. Liu, S. Sun, and C.-Y. Lin. Nonlinear evidence fusion and propagation for hyponymy relation mining. In ACL, pages 1159--1168, 2011."}],"event":{"name":"MM '13: ACM Multimedia Conference","location":"Barcelona Spain","acronym":"MM '13","sponsor":["SIGMM ACM Special Interest Group on Multimedia"]},"container-title":["Proceedings of the 21st ACM international conference on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502081.2502283","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502081.2502283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:35Z","timestamp":1750231715000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502081.2502283"}},"subtitle":["towards bridging semantic and intent gaps via mining click logs of search engines"],"short-title":[],"issued":{"date-parts":[[2013,10,21]]},"references-count":25,"alternative-id":["10.1145\/2502081.2502283","10.1145\/2502081"],"URL":"https:\/\/doi.org\/10.1145\/2502081.2502283","relation":{},"subject":[],"published":{"date-parts":[[2013,10,21]]},"assertion":[{"value":"2013-10-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}