{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:32:14Z","timestamp":1730248334847,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T00:00:00Z","timestamp":1691539200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,8,9]]},"DOI":"10.1109\/icit58056.2023.10226046","type":"proceedings-article","created":{"date-parts":[[2023,8,29]],"date-time":"2023-08-29T17:26:12Z","timestamp":1693329972000},"page":"524-530","source":"Crossref","is-referenced-by-count":0,"title":["A Dynamic Locality Sensitive Hashing Algorithm for Efficient Security Applications"],"prefix":"10.1109","author":[{"given":"Mohammad","family":"Y.AlKhanafseh","sequence":"first","affiliation":[{"name":"Birzeit University,Department of Computer Science,Ramallah,Palestine"}]},{"given":"Ola","family":"M.Surakhi","sequence":"additional","affiliation":[{"name":"American University of Madaba,Department of Computer Science,Madaba,Jordan"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053052"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00169"},{"key":"ref15","article-title":"A time-space efficient locality sensitive hashing method for similarity search in high dimensions","author":"lv","year":"2006","journal-title":"Technical Report Tech Rep"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080800"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2015.08.005"},{"key":"ref17","article-title":"Super-bit locality-sensitive hashing","volume":"25","author":"ji","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref16","first-page":"950","article-title":"Multi-probe lsh: efficient indexing for high-dimensional similarity search","year":"0","journal-title":"Proceedings of the 33rd International Conference on Very Large Data Bases"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1873951.1874004"},{"key":"ref18","article-title":"Bayesian locality sen-sitive hashing for fast similarity search","author":"satuluri","year":"2011","journal-title":"ArXiv Preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/EMBC.2016.7591233"},{"key":"ref23","article-title":"Asymmetric lsh (alsh) for sublinear time maximum inner product search (mips)","volume":"27","author":"shrivastava","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref26","article-title":"A survey on locality sensitive hashing algorithms and their applications","author":"jafari","year":"2021","journal-title":"ArXiv Preprint"},{"key":"ref25","first-page":"152","article-title":"Efficient incre-mental near duplicate detection based on locality sensitive hashing","author":"fisichella","year":"0","journal-title":"Database and Expert Systems Applications 21st International Conference DEXA 2010 Bilbao Spain August 30-September 3 2010 Proceedings Part I 21"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.4236\/jilsa.2015.72005"},{"key":"ref22","first-page":"93","article-title":"Semi-supervised simhash for efficient document similarity search","author":"jiang","year":"0","journal-title":"Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics Human Language Technologies"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.145"},{"key":"ref28","first-page":"518","article-title":"Similarity search in high dimensions via hashing","volume":"99","author":"gionis","year":"1999","journal-title":"VLDB"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3115\/1219840.1219917"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1007\/s11192-017-2569-6","article-title":"Use of locality sensitive hashing (lsh) algorithm to match web of science and scopus","volume":"116","author":"abdulhayoglu","year":"2018","journal-title":"Scientometrics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-016-0997-x"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NCC.2017.8077058"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223813"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"}],"event":{"name":"2023 International Conference on Information Technology (ICIT)","start":{"date-parts":[[2023,8,9]]},"location":"Amman, Jordan","end":{"date-parts":[[2023,8,10]]}},"container-title":["2023 International Conference on Information Technology (ICIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10225686\/10225751\/10226046.pdf?arnumber=10226046","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T17:43:05Z","timestamp":1695058985000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10226046\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,9]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icit58056.2023.10226046","relation":{},"subject":[],"published":{"date-parts":[[2023,8,9]]}}}