{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:15:41Z","timestamp":1763468141777,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"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,8,11]]},"DOI":"10.1145\/2487575.2487668","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T12:31:21Z","timestamp":1376397081000},"page":"230-238","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Comparing apples to oranges"],"prefix":"10.1145","author":[{"given":"Mingdong","family":"Ou","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Peng","family":"Cui","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Fei","family":"Wang","sequence":"additional","affiliation":[{"name":"IBM Watson Research Center, Yorktown Heights, New York, USA"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"IBM Watson Research Center, Yorktown Heights, New York, USA"}]},{"given":"Wenwu","family":"Zhu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Shiqiang","family":"Yang","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/944919.944937"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276781"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539928"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1646396.1646452"},{"issue":"17","key":"e_1_3_2_1_6_1","first-page":"178701","volume":"107","author":"Del Genio C. I.","year":"2011","unstructured":"C. I. Del Genio , T. Gross , and K. E. Bassler . All scale-free networks are sparse. Physical Review Letters , 107 ( 17 ): 178701 , 2011 . C. I. Del Genio, T. Gross, and K. E. Bassler. All scale-free networks are sparse. Physical Review Letters, 107(17):178701, 2011.","journal-title":"All scale-free networks are sparse. Physical Review Letters"},{"key":"e_1_3_2_1_7_1","first-page":"1205","volume-title":"Proc. of NIPS","author":"Gong Y.","year":"2012","unstructured":"Y. Gong , S. Kumar , V. Verma , and S. Lazebnik . Angular quantization-based binary codes for fast similarity search . In Proc. of NIPS , pages 1205 -- 1213 , 2012 . Y. Gong, S. Kumar, V. Verma, and S. Lazebnik. Angular quantization-based binary codes for fast similarity search. In Proc. of NIPS, pages 1205--1213, 2012."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"e_1_3_2_1_9_1","first-page":"2957","volume-title":"Proc. of CVPR","author":"Heo J.-P.","year":"2012","unstructured":"J.-P. Heo , Y. Lee , J. He , S.-F. Chang , and S.-E. Yoon . Spherical hashing . In Proc. of CVPR , pages 2957 -- 2964 , 2012 . J.-P. Heo, Y. Lee, J. He, S.-F. Chang, and S.-E. Yoon. Spherical hashing. In Proc. of CVPR, pages 2957--2964, 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398448"},{"key":"e_1_3_2_1_12_1","first-page":"1655","volume-title":"Proc. of NIPS","author":"Kong W.","year":"2012","unstructured":"W. Kong and W.-J. Li . Isotropic hashing . In Proc. of NIPS , pages 1655 -- 1663 , 2012 . W. Kong and W.-J. Li. Isotropic hashing. In Proc. of NIPS, pages 1655--1663, 2012."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.151"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2283516.2283623"},{"key":"e_1_3_2_1_16_1","first-page":"2074","volume-title":"Proc. of CVPR","author":"Liu W.","year":"2012","unstructured":"W. Liu , J. Wang , R. Ji , Y.-G. Jiang , and S.-F. Chang . Supervised hashing with kernels . In Proc. of CVPR , pages 2074 -- 2081 , 2012 . W. Liu, J. Wang, R. Ji, Y.-G. Jiang, and S.-F. Chang. Supervised hashing with kernels. In Proc. of CVPR, pages 2074--2081, 2012."},{"key":"e_1_3_2_1_17_1","first-page":"1","volume-title":"Proc. of ICML","author":"Liu W.","year":"2011","unstructured":"W. Liu , J. Wang , S. Kumar , and S.-F. Chang . Hashing with graphs . In Proc. of ICML , pages 1 -- 8 , 2011 . W. Liu, J. Wang, S. Kumar, and S.-F. Chang. Hashing with graphs. In Proc. of ICML, pages 1--8, 2011."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/850924.851523"},{"key":"e_1_3_2_1_19_1","first-page":"1070","volume-title":"Proc. of NIPS","author":"Norouzi M.","year":"2012","unstructured":"M. Norouzi , D. Fleet , and R. Salakhutdinov . Hamming distance metric learning . In Proc. of NIPS , pages 1070 -- 1078 , 2012 . M. Norouzi, D. Fleet, and R. Salakhutdinov. Hamming distance metric learning. In Proc. of NIPS, pages 1070--1078, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2072298.2072354"},{"key":"e_1_3_2_1_21_1","first-page":"219","volume-title":"Optimization for Machine Learning","author":"Sontag D.","year":"2010","unstructured":"D. Sontag , A. Globerson , and T. Jaakkola . Introduction to dual decomposition for inference . In S. Sra, S. Nowozin, and S. Wright, Eds., Optimization for Machine Learning . MIT Press , pages 219 -- 252 , 2010 . D. Sontag, A. Globerson, and T. Jaakkola. Introduction to dual decomposition for inference. In S. Sra, S. Nowozin, and S. Wright, Eds., Optimization for Machine Learning. MIT Press, pages 219--252, 2010."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587633"},{"key":"e_1_3_2_1_23_1","first-page":"1127","volume-title":"Proc. of ICML","author":"Wang J.","year":"2010","unstructured":"J. Wang , S. Kumar , and S.-F. Chang . Sequential projection learning for hashing with compact codes . In Proc. of ICML , pages 1127 -- 1134 , 2010 . J. Wang, S. Kumar, and S.-F. Chang. Sequential projection learning for hashing with compact codes. In Proc. of ICML, pages 1127--1134, 2010."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.48"},{"key":"e_1_3_2_1_25_1","first-page":"1753","volume-title":"Proc. of NIPS","author":"Weiss Y.","year":"2008","unstructured":"Y. Weiss , A. Torralba , and R. Fergus . Spectral hashing . In Proc. of NIPS , pages 1753 -- 1760 , 2008 . Y. Weiss, A. Torralba, and R. Fergus. Spectral hashing. In Proc. of NIPS, pages 1753--1760, 2008."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339678"},{"key":"e_1_3_2_1_27_1","first-page":"1385","volume-title":"Proc. of NIPS","author":"Zhen Y.","year":"2012","unstructured":"Y. Zhen and D.-Y. Yeung . Co-regularized hashing for multimodal data . In Proc. of NIPS , pages 1385 -- 1393 , 2012 . Y. Zhen and D.-Y. Yeung. Co-regularized hashing for multimodal data. In Proc. of NIPS, pages 1385--1393, 2012."}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Chicago Illinois USA","acronym":"KDD' 13"},"container-title":["Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487668","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487668","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:44Z","timestamp":1750236524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487668"}},"subtitle":["a scalable solution with heterogeneous hashing"],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":27,"alternative-id":["10.1145\/2487575.2487668","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487668","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}