{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:20:42Z","timestamp":1740108042224,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T00:00:00Z","timestamp":1600300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s00521-020-05336-1","type":"journal-article","created":{"date-parts":[[2020,9,17]],"date-time":"2020-09-17T14:35:27Z","timestamp":1600353327000},"page":"3753-3766","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient locality-sensitive hashing over high-dimensional streaming data"],"prefix":"10.1007","volume":"35","author":[{"given":"Hao","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5128-8882","authenticated-orcid":false,"given":"Chengcheng","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangliang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,17]]},"reference":[{"key":"5336_CR1","unstructured":"Weber R, Schek H-J, Blott S (1998) A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In: VLDB, pp 194\u2013205"},{"key":"5336_CR2","doi-asserted-by":"crossref","unstructured":"Indyk P ,Motwani R (1998) Approximate nearest neighbors: towards removing the curse of dimensionality. In: STOC, pp 604\u2013613","DOI":"10.1145\/276698.276876"},{"key":"5336_CR3","unstructured":"Li Q, Sun Z, He R, Tan T (2017) Deep supervised discrete hashing. In: NIPS, pp 2482\u20132491"},{"key":"5336_CR4","doi-asserted-by":"crossref","unstructured":"Gao J, Jagadish HV, Lu W,Ooi BC (2014) DSH: data sensitive hashing for high-dimensional k-NN search. In: SIGMOD, pp 1127\u20131138","DOI":"10.1145\/2783258.2783284"},{"key":"5336_CR5","doi-asserted-by":"crossref","unstructured":"Zhao K, Lu H, Mei J (2014) Locality preserving hashing. In: AAAI, pp 2874\u20132881","DOI":"10.1609\/aaai.v28i1.9133"},{"key":"5336_CR6","doi-asserted-by":"crossref","unstructured":"Gao J., Jagadish HV, Ooi BC, Wang S (2015) Selective hashing: closing the gap between radius search and k-nn search. In: SIGKDD, pp 349\u2013358","DOI":"10.1145\/2783258.2783284"},{"key":"5336_CR7","unstructured":"Lv Q, Josephson W, Wang Z, Charikar M, Li K (2007) Multi-probe LSH: efficient indexing for high-dimensional similarity search. In: VLDB, pp 950\u2013961"},{"key":"5336_CR8","doi-asserted-by":"crossref","unstructured":"Gan J, Feng J, Fang Q, Ng W (2012) Locality-sensitive hashing scheme based on dynamic collision counting. In: SIGMOD, pages 541\u2013552","DOI":"10.1145\/2213836.2213898"},{"issue":"5","key":"5336_CR9","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00778-017-0472-7","volume":"26","author":"Q Huang","year":"2017","unstructured":"Huang Q, Feng J, Fang Q, Ng W, Wang W (2017) Query-aware locality-sensitive hashing scheme for l$${}_{{p}}$$ norm. VLDB J 26(5):683\u2013708","journal-title":"VLDB J."},{"issue":"1","key":"5336_CR10","first-page":"1","volume":"8","author":"Y Sun","year":"2014","unstructured":"Sun Y, Wang W, Qin J, Zhang Y, Lin X (2014) SRS: solving c-approximate nearest neighbor queries in high dimensional euclidean space with a tiny index. PVLDB 8(1):1\u201312","journal-title":"PVLDB"},{"issue":"3","key":"5336_CR11","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s10994-012-5320-9","volume":"90","author":"J Gama","year":"2013","unstructured":"Gama J, Sebasti\u00e3o R, Rodrigues PP (2013) On evaluating stream learning algorithms. Mach Learn 90(3):317\u2013346","journal-title":"Mach Learn"},{"key":"5336_CR12","doi-asserted-by":"publisher","first-page":"1242","DOI":"10.1007\/s10618-017-0500-7","volume":"31","author":"T Zhai","year":"2017","unstructured":"Zhai T, Gao Y, Wang H, Cao L (2017) Classification of high-dimensional evolving data streams via a resource-efficient online ensemble. Data Min Knowl Disc 31:1242\u20131265","journal-title":"Data Min Knowl Disc"},{"key":"5336_CR13","unstructured":"Andoni A, Indyk P, Laarhoven T, Razenshteyn IP, Schmidt L (2015) Practical and optimal LSH for angular distance. In: NIPS, pp 1225\u20131233"},{"key":"5336_CR14","doi-asserted-by":"crossref","unstructured":"Eshghi K, Rajaram S (2008) Locality sensitive hash functions based on concomitant rank order statistics. In: SIGKDD, pp 221\u2013229","DOI":"10.1145\/1401890.1401921"},{"key":"5336_CR15","doi-asserted-by":"crossref","unstructured":"Datar M, Immorlica N, Indyk P, Mirrokni VS (2004) Locality-sensitive hashing scheme based on p-stable distributions. In: SoCG, pp 253\u2013262","DOI":"10.1145\/997817.997857"},{"key":"5336_CR16","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s002360050048","volume":"33","author":"P O\u2019Neil","year":"1996","unstructured":"O\u2019Neil P, Cheng E, Gawlick D, O\u2019Neil E (1996) The log-structured merge-tree (LSM-tree). Acta Informatica 33(4):351\u2013385","journal-title":"Acta Informatica"},{"issue":"35","key":"5336_CR17","first-page":"20:1","volume":"35","author":"Y Tao","year":"2010","unstructured":"Tao Y, Yi K, Sheng C, Kalnis P (2010) Efficient and accurate nearest neighbor and closest pair search in high-dimensional space. ACM Trans Database Syst 35(35):20:1\u201320:4620:46","journal-title":"ACM Trans Database Syst"},{"key":"5336_CR18","doi-asserted-by":"crossref","unstructured":"Zheng Y, Guo Q, Tung Anthony KH, Wu S (2016) LazyLSH: approximate nearest neighbor search for multiple distance functions with a single index. In: SIGMOD, pp 2023\u20132037","DOI":"10.1145\/2882903.2882930"},{"key":"5336_CR19","doi-asserted-by":"crossref","unstructured":"Panigrahy R (2006) Entropy based nearest neighbor search in high dimensions. In: SODA, pp 1186\u20131195","DOI":"10.1145\/1109557.1109688"},{"issue":"9","key":"5336_CR20","first-page":"745","volume":"7","author":"Y Liu","year":"2014","unstructured":"Liu Y, Cui J, Huang Z, Li H, Shen HT (2014) SK-LSH: an efficient index structure for approximate nearest neighbor search. PVLDB 7(9):745\u2013756","journal-title":"PVLDB"},{"key":"5336_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.patrec.2018.04.027","volume":"117","author":"C Chu","year":"2019","unstructured":"Chu C, Gong D, Chen K, Guo Y, Han J, Ding G (2019) Optimized projection for hashing. Pattern Recognit Lett 117:169\u2013178","journal-title":"Pattern Recognition Letters"},{"key":"5336_CR22","doi-asserted-by":"crossref","unstructured":"Liu X, Nie X, Wang Y, Yin Y (2019) Jointly multiple hash learning. In: AAAI, pp 9981\u20139982","DOI":"10.1609\/aaai.v33i01.33019981"},{"key":"5336_CR23","doi-asserted-by":"crossref","unstructured":"Dayan Ni, Athanassoulis M, Idreos S (2017) Monkey: optimal navigable key-value store. In: SIGMOD, pp 79\u201394","DOI":"10.1145\/3035918.3064054"},{"key":"5336_CR24","doi-asserted-by":"crossref","unstructured":"Liu W, Wang H, Zhang Y, Wang W, Qin L (2019) I-LSH: I\/O efficient c-approximate nearest neighbor search in high-dimensional space. In: ICDE, pp 1670\u20131673","DOI":"10.1109\/ICDE.2019.00169"},{"issue":"1","key":"5336_CR25","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TPAMI.2010.57","volume":"33","author":"H J\u00e9gou","year":"2011","unstructured":"J\u00e9gou H, Douze M, Schmid C (2011) Product quantization for nearest neighbor search. IEEE Trans Pattern Anal Mach Intell 33(1):117\u2013128","journal-title":"IEEE Trans Pattern Anal Mach Intell"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05336-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05336-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05336-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T05:06:45Z","timestamp":1674796005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05336-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,17]]},"references-count":25,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["5336"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05336-1","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"type":"print","value":"0941-0643"},{"type":"electronic","value":"1433-3058"}],"subject":[],"published":{"date-parts":[[2020,9,17]]},"assertion":[{"value":"20 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interests regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}