{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T14:55:32Z","timestamp":1777733732328,"version":"3.51.4"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"Research Grants Council of the Hong Kong Special Administrative Region","award":["CUHK 14208815, CUHK 14234416, and UGC\/IDS14\/16"],"award-info":[{"award-number":["CUHK 14208815, CUHK 14234416, and UGC\/IDS14\/16"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tkde.2019.2934687","type":"journal-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T20:15:59Z","timestamp":1565813759000},"page":"1-1","source":"Crossref","is-referenced-by-count":16,"title":["Making Online Sketching Hashing Even Faster"],"prefix":"10.1109","author":[{"given":"Xixian","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiqin","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shenglin","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Lyu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irwin","family":"King","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"910","article-title":"Efficient second order online learning by sketching","author":"luo","year":"2016","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref38","first-page":"369","article-title":"Faster ridge regression via the subsampled randomized hadamard transform","author":"lu","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487623"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.435"},{"key":"ref31","first-page":"1711","article-title":"Feature learning based deep supervised hashing with pairwise labels","author":"li","year":"2016","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298865"},{"key":"ref37","first-page":"3419","article-title":"Discrete graph hashing","author":"liu","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref36","first-page":"1258","article-title":"Towards optimal binary code learning via ordinal embedding","author":"liu","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref35","first-page":"2238","article-title":"Ordinal constrained binary code learning for nearest neighbor search","author":"liu","year":"2017","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.253"},{"key":"ref28","article-title":"Learning multiple layers of features from tiny images","author":"krizhevsky","year":"2009"},{"key":"ref27","first-page":"1230","article-title":"Column sampling based discrete supervised hashing","author":"kang","year":"2016","journal-title":"Proc AAAI Conf Artif Intell"},{"key":"ref29","first-page":"1042","article-title":"Learning to hash with binary reconstructive embeddings","author":"kulis","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2672725"},{"key":"ref1","first-page":"1","article-title":"Fast dimension reduction using rademacher series on dual BCH codes","author":"ailon","year":"2008","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00423"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref21","first-page":"1422","article-title":"Online hashing","author":"huang","year":"2013","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5540039"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref26","author":"jolliffe","year":"2002","journal-title":"Principal Component Analysis"},{"key":"ref25","first-page":"2248","article-title":"Scalable graph hashing with feature transformation","author":"jiang","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2010.5539994"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref57","first-page":"ii-946","article-title":"Circulant binary embedding","author":"yu","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-016-3432-0"},{"key":"ref55","first-page":"2585","article-title":"Single pass PCA of matrix products","author":"wu","year":"2016","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04125-9_58"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref52","first-page":"1753","article-title":"Spectral hashing","author":"weiss","year":"2009","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/509961.509965"},{"key":"ref11","article-title":"FROSH: FasteR online sketching hashing","author":"chen","year":"2017","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref40","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"ref12","first-page":"767","article-title":"Toward efficient and accurate covariance matrix estimation on compressed data","author":"chen","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref13","first-page":"3395","article-title":"Training-efficient feature map for shift-invariant kernels","author":"chen","year":"2015","journal-title":"Proc Int Joint Conf Artif Intell"},{"key":"ref14","first-page":"344","article-title":"Binary embeddings with structured hashed projections","author":"choromanska","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.166"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2013.237"},{"key":"ref17","first-page":"360","article-title":"New subsampling algorithms for fast least squares regression","author":"dhillon","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref18","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc 5th Int Conf Very Large Data Bases"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.193"},{"key":"ref4","first-page":"2258","article-title":"Subspace embeddings for the polynomial kernel","author":"avron","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref3","first-page":"1225","article-title":"Practical and optimal LSH for angular distance","author":"andoni","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref6","first-page":"344","article-title":"Hashing with binary matrix pursuit","author":"cakir","year":"2018","journal-title":"Proc Eur Conf Comput Vis"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.55"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2015.7351274"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.125"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1561\/2200000048"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7298598"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.472"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2733373.2806341"},{"key":"ref47","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","author":"shrivastava","year":"2014","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref42","first-page":"2823","article-title":"The power of asymmetry in binary hashing","author":"neyshabur","year":"2013","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2015.476"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2011.5995504"},{"key":"ref43","first-page":"1846","article-title":"Spherical random features for polynomial kernels","author":"pennington","year":"2015","journal-title":"Proc Int Conf Neural Inf Process"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/08798666.pdf?arnumber=8798666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T14:44:08Z","timestamp":1643208248000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8798666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/tkde.2019.2934687","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}