{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:40:07Z","timestamp":1750228807530,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T00:00:00Z","timestamp":1434931200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61273257, 61321491"],"award-info":[{"award-number":["61273257, 61321491"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Scientific Research Foundation of Graduate School of Nanjing University","award":["2014CL03"],"award-info":[{"award-number":["2014CL03"]}]},{"name":"Program for New Century Excellent Talents of MOE China","award":["NCET-11-0213"],"award-info":[{"award-number":["NCET-11-0213"]}]},{"name":"Program for Distinguished Talents of Jiangsu","award":["2013-XXRJ-018"],"award-info":[{"award-number":["2013-XXRJ-018"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,6,22]]},"DOI":"10.1145\/2671188.2749397","type":"proceedings-article","created":{"date-parts":[[2015,6,22]],"date-time":"2015-06-22T15:37:08Z","timestamp":1434987428000},"page":"615-618","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Binary Codes for Hashing via Feature Decomposition"],"prefix":"10.1145","author":[{"given":"Xiao-Jiao","family":"Mao","sequence":"first","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen-Fei","family":"Ju","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xu","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yu-Bin","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2015,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/355744.355745"},{"key":"e_1_3_2_1_3_1","first-page":"518","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In VLDB , pages 518 -- 529 , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518--529, 1999."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"e_1_3_2_1_5_1","first-page":"1042","volume-title":"NIPS","author":"Kulis B.","year":"2009","unstructured":"B. Kulis and T. Darrell . Learning to hash with binary reconstructive embeddings . In NIPS , pages 1042 -- 1050 , 2009 . B. Kulis and T. Darrell. Learning to hash with binary reconstructive embeddings. In NIPS, pages 1042--1050, 2009."},{"key":"e_1_3_2_1_6_1","first-page":"825","volume-title":"NIPS","author":"Liu T.","year":"2004","unstructured":"T. Liu , A. W. Moore , A. G. Gray , and K. Yang . An investigation of practical approximate nearest neighbor algorithms . In NIPS , pages 825 -- 832 , 2004 . T. Liu, A. W. Moore, A. G. Gray, and K. Yang. An investigation of practical approximate nearest neighbor algorithms. In NIPS, pages 825--832, 2004."},{"key":"e_1_3_2_1_7_1","first-page":"1","volume-title":"ICML","author":"Liu W.","year":"2011","unstructured":"W. Liu , J. Wang , S. Kumar , and S. Chang . Hashing with graphs . In ICML , pages 1 -- 8 , 2011 . W. Liu, J. Wang, S. Kumar, and S. Chang. Hashing with graphs. In ICML, pages 1--8, 2011."},{"key":"e_1_3_2_1_8_1","first-page":"353","volume-title":"ICML","author":"Norouzi M.","year":"2011","unstructured":"M. Norouzi and D. J. Fleet . Minimal loss hashing for compact binary codes . In ICML , pages 353 -- 360 , 2011 . M. Norouzi and D. J. Fleet. Minimal loss hashing for compact binary codes. In ICML, pages 353--360, 2011."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011139631724"},{"key":"e_1_3_2_1_10_1","first-page":"412","volume-title":"AISTATS","author":"Salakhutdinov R.","year":"2007","unstructured":"R. Salakhutdinov and G. E. Hinton . Learning a nonlinear embedding by preserving class neighbourhood structure . In AISTATS , pages 412 -- 419 , 2007 . R. Salakhutdinov and G. E. Hinton. Learning a nonlinear embedding by preserving class neighbourhood structure. In AISTATS, pages 412--419, 2007."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.205"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"e_1_3_2_1_13_1","first-page":"1753","volume-title":"NIPS","author":"Weiss Y.","year":"2008","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In NIPS , pages 1753 -- 1760 , 2008 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In NIPS, pages 1753--1760, 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1261097"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539957"}],"event":{"name":"ICMR '15: International Conference on Multimedia Retrieval","sponsor":["SIGMM ACM Special Interest Group on Multimedia"],"location":"Shanghai China","acronym":"ICMR '15"},"container-title":["Proceedings of the 5th ACM on International Conference on Multimedia Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2671188.2749397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2671188.2749397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:17:03Z","timestamp":1750227423000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2671188.2749397"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,22]]},"references-count":15,"alternative-id":["10.1145\/2671188.2749397","10.1145\/2671188"],"URL":"https:\/\/doi.org\/10.1145\/2671188.2749397","relation":{},"subject":[],"published":{"date-parts":[[2015,6,22]]},"assertion":[{"value":"2015-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}