{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:16:09Z","timestamp":1750306569209,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T00:00:00Z","timestamp":1414972800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001348","name":"Agency for Science, Technology and Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001348","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,3]]},"DOI":"10.1145\/2647868.2655003","type":"proceedings-article","created":{"date-parts":[[2014,11,3]],"date-time":"2014-11-03T14:41:51Z","timestamp":1415025711000},"page":"989-992","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Supervised Discriminative Hashing for Compact Binary Codes"],"prefix":"10.1145","author":[{"given":"Viet Anh","family":"Nguyen","sequence":"first","affiliation":[{"name":"Advanced Digital Sciences Center, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwen","family":"Lu","sequence":"additional","affiliation":[{"name":"Advanced Digital Sciences Center, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minh N.","family":"Do","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,11,3]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis Similarity search in high dimensions via hashing . In Proc. VLDB , 1999 . A. Gionis et al. Similarity search in high dimensions via hashing. In Proc. VLDB, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1027527.1027530"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. NIPS","author":"Kulis B.","year":"2009","unstructured":"B. Kulis and T. Darrell . Learning to hash with binary reconstructive embeddings . In Proc. NIPS , 2009 . B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In Proc. NIPS, 2009."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Norouzi M.","year":"2011","unstructured":"M. Norouzi and D. Fleet . Minimal loss hashing for compact binary codes . In Proc. Int. Conf. Mach. Learn. , 2011 . M. Norouzi and D. Fleet. Minimal loss hashing for compact binary codes. In Proc. Int. Conf. Mach. Learn., 2011."},{"key":"e_1_3_2_1_6_1","volume-title":"Proc. NIPS","author":"Raginsky M.","year":"2009","unstructured":"M. Raginsky and S. Lazebnik . Locality sensitive binary codes from shift-invariant kernels . In Proc. NIPS , 2009 . M. Raginsky and S. Lazebnik. Locality sensitive binary codes from shift-invariant kernels. In Proc. NIPS, 2009."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.103"},{"key":"e_1_3_2_1_8_1","volume-title":"Proc. ICML","author":"Wang J.","year":"2010","unstructured":"J. Wang Sequential projection learning for hashing with compact codes . In Proc. ICML , 2010 . J. Wang et al. Sequential projection learning for hashing with compact codes. In Proc. ICML, 2010."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. NIPS","author":"Weiss Y.","year":"2008","unstructured":"Y. Weiss Spectral hashing . In Proc. NIPS , 2008 . Y. Weiss et al. Spectral hashing. In Proc. NIPS, 2008."},{"key":"e_1_3_2_1_11_1","volume-title":"Mathematical Programming","author":"Wen Z.","year":"2013","unstructured":"Z. Wen and Y. Yin . A feasible method for optimization with orthogonality constraints . Mathematical Programming , 2013 . Z. Wen and Y. Yin. A feasible method for optimization with orthogonality constraints. Mathematical Programming, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"}],"event":{"name":"MM '14: 2014 ACM Multimedia Conference","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Orlando Florida USA","acronym":"MM '14"},"container-title":["Proceedings of the 22nd ACM international conference on Multimedia"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2647868.2655003","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2647868.2655003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:13:20Z","timestamp":1750227200000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2647868.2655003"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,3]]},"references-count":12,"alternative-id":["10.1145\/2647868.2655003","10.1145\/2647868"],"URL":"https:\/\/doi.org\/10.1145\/2647868.2655003","relation":{},"subject":[],"published":{"date-parts":[[2014,11,3]]},"assertion":[{"value":"2014-11-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}