{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T12:12:32Z","timestamp":1780488752854,"version":"3.54.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T00:00:00Z","timestamp":1406851200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"crossref","award":["2013CB336500"],"award-info":[{"award-number":["2013CB336500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["61222207"],"award-info":[{"award-number":["61222207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Nature Science Foundation of China","doi-asserted-by":"crossref","award":["91120302"],"award-info":[{"award-number":["91120302"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/tcyb.2013.2283497","type":"journal-article","created":{"date-parts":[[2013,10,23]],"date-time":"2013-10-23T18:10:07Z","timestamp":1382551807000},"page":"1362-1371","source":"Crossref","is-referenced-by-count":191,"title":["Density Sensitive Hashing"],"prefix":"10.1109","volume":"44","author":[{"given":"Zhongming","family":"Jin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yue","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2010.04.004"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109688"},{"key":"ref33","first-page":"1","article-title":"Hashing with graphs","author":"liu","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref32","first-page":"2074","article-title":"Supervised hashing with kernels","author":"liu","year":"2012","journal-title":"Proc CVPR"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.64"},{"key":"ref30","first-page":"641","article-title":"Random projection with filtering for nearly duplicate search","author":"lin","year":"2012","journal-title":"Proc AAAI"},{"key":"ref37","first-page":"353","article-title":"Minimal loss hashing for compact binary codes","author":"norouzi","year":"2011","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540024"},{"key":"ref35","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref34","first-page":"17","article-title":"Compact hyperplane hashing with bilinear functions","author":"liu","year":"2012","journal-title":"Proc ICML"},{"key":"ref28","first-page":"3122","article-title":"One permutation hashing","author":"li","year":"2012","journal-title":"Proc NIPS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref29","first-page":"2672","article-title":"Hashing algorithms for large-scale learning","author":"li","year":"0","journal-title":"Proc Neur Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007608"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327494"},{"key":"ref20","first-page":"93","article-title":"Semi-supervised simhash for efficient document similarity search","author":"jiang","year":"2011","journal-title":"Proc Annu Meeting Assoc Comput Linguist Conf Human Lang Technol"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1459359.1459388"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1090\/conm\/026\/737400","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemp Math"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/B978-012088469-8.50074-7"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995709"},{"key":"ref26","first-page":"215","article-title":"Fast nearest neighbor search in medical image databases","author":"korn","year":"1996","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref25","first-page":"1655","article-title":"Isotropic hashing","author":"kong","year":"2012","journal-title":"Proc NIPS"},{"key":"ref50","first-page":"577","article-title":"Laplacian co-hashing of terms and documents","author":"zhang","year":"2010","journal-title":"Proc ECIR"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/1835449.1835455"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339678"},{"key":"ref53","first-page":"1385","article-title":"Co-regularized hashing for multimodal data","author":"zhen","year":"2012","journal-title":"Proc NIPS"},{"key":"ref52","first-page":"681","article-title":"A unified approximate nearest neighbor search scheme by combining data structure and hashing","author":"zhang","year":"2013","journal-title":"Proc IJCAI"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-010-0200-z"},{"key":"ref40","first-page":"1509","article-title":"Locality-sensitive binary codes from shift-invariant kernels","author":"raginsky","year":"2009","journal-title":"Proc Neur Inf Process Syst"},{"key":"ref12","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref13","first-page":"1205","article-title":"Angular quantization-based binary codes for fast similarity search","author":"gong","year":"2012","journal-title":"Proc Adv Neur Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995432"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995518"},{"key":"ref16","first-page":"65","article-title":"On the difficulty of nearest neighbor search","author":"he","year":"2012","journal-title":"Proc ICML"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835946"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref19","first-page":"108","article-title":"Super-bit locality-sensitive hashing","author":"ji","year":"0","journal-title":"Proc NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/361002.361007"},{"key":"ref3","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kullis","year":"2010","journal-title":"Proc Neur Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539852"},{"key":"ref5","first-page":"217","article-title":"When is nearest neighbor meaningful?","author":"beyer","year":"1999","journal-title":"Proc ICDT"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref7","author":"cai","year":"2009","journal-title":"Spectral regression A regression framework for efficient regularized subspace learning"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1937728.1937730"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020578"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.76"},{"key":"ref45","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2008","journal-title":"Proc Neur Inf Process Syst"},{"key":"ref48","first-page":"1631","article-title":"Complementary hashing for approximate nearest neighbor search","author":"xu","year":"2011","journal-title":"Proc IEEE Int Conf Comput Vision"},{"key":"ref47","first-page":"1820","article-title":"Harmonious hashing","author":"xu","year":"2013","journal-title":"Proc IJCAI"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2008.11.006"},{"key":"ref44","first-page":"1483","article-title":"AnnoSearch: Image auto-annotation by search","author":"wang","year":"2006","journal-title":"Proc IEEE Conf Comput Vision Pattern Recognit"},{"key":"ref43","first-page":"1127","article-title":"Sequential projection learning for hashing with compact codes","author":"wang","year":"2010","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/6856256\/06645383.pdf?arnumber=6645383","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:18:18Z","timestamp":1642004298000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6645383\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":54,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2013.2283497","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8]]}}}