{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:54:44Z","timestamp":1758045284517,"version":"3.44.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100019687","name":"Hamad bin Khalifa University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100019687","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100019779","name":"Qatar National Library","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100019779","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Open J. Comput. Soc."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/ojcs.2025.3602355","type":"journal-article","created":{"date-parts":[[2025,8,25]],"date-time":"2025-08-25T20:50:05Z","timestamp":1756155005000},"page":"1402-1413","source":"Crossref","is-referenced-by-count":0,"title":["Gaussian Kernel-Based LSH for High-Dimensional Similarity Search"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2741-6407","authenticated-orcid":false,"given":"Masrat","family":"Rasool","sequence":"first","affiliation":[{"name":"College of Science and Engineering, Hamad Bin Khalifa University, Doha, Qatar"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0792-0534","authenticated-orcid":false,"given":"Khelil","family":"Kassoul","sequence":"additional","affiliation":[{"name":"Geneva School of Business Administration (HES-SO), University of Applied Sciences Western Switzerland, Geneva, Switzerland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2336-0490","authenticated-orcid":false,"given":"Samir Brahim","family":"Belhaouari","sequence":"additional","affiliation":[{"name":"College of Science and Engineering, Hamad Bin Khalifa University, Doha, Qatar"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TBDATA.2019.2921572"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2019.02.006"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2014.2321376"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2889473"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.57"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"issue":"1","key":"ref10","first-page":"1","article-title":"Algorithms for manifold learning","volume":"12","author":"Cayton","year":"2005","journal-title":"Univ. of California at San Diego"},{"key":"ref11","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","volume-title":"Proc. 33rd Int. Conf. Very Large Data Bases","author":"Lv","year":"2007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.14778\/2850469.2850470"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2009.5459466"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1117\/12.2285034","article-title":"Adaptive hash retrieval with kernel-based similarity","volume":"81","author":"Liu","year":"2018","journal-title":"Pattern Recognit."},{"issue":"3","key":"ref16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3183370","article-title":"FastLSH: Accelerating approximate nearest neighbor search with optimized random sampling","volume":"41","author":"Tan","year":"2023","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.598"},{"key":"ref18","first-page":"1711","article-title":"Feature learning based deep supervised hashing with pairwise labels","volume-title":"Proc. 25th Int. Joint Conf. Artif. Intell.","author":"Li","year":"2016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2699960"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963487"},{"key":"ref21","article-title":"DiskANN: Fast accurate billion-point nearest neighbor search on a single node","volume":"32","author":"Jayaram Subramanya","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref22","first-page":"435","article-title":"Accelerating large-scale inference with anisotropic vector quantization","volume-title":"Proc. 43rd Int. ACM SIGIR Conf. Res. Develop. Inf. Retrieval","author":"Guo","year":"2020"},{"key":"ref23","first-page":"91","article-title":"Refining density-based clustering with pivot-based indexing","volume-title":"Proc. 5th ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining","author":"Bennett","year":"1999"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956757"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2025.110742"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665854"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05810-8_22"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.14778\/3665844.3665854"},{"volume-title":"Pattern Recognition and Machine Learning","year":"2006","author":"Bishop","key":"ref29"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1810.04805"},{"article-title":"AnnoyApproximate Nearest Neighbors in C \/Python","year":"2016","author":"Bernhardsson","key":"ref31"},{"key":"ref32","article-title":"Optimizing domain-specific image retrieval: A benchmark of hashing and ann techniques","author":"Rahman","year":"2024","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref33","first-page":"13766","article-title":"Diskann: Fast accurate billion-point nearest neighbor search on a single node","volume":"32","author":"Jayaram Subramanya","year":"2019","journal-title":"Adv. Neural Inf. Process. Syst."}],"container-title":["IEEE Open Journal of the Computer Society"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8782664\/10834807\/11134766.pdf?arnumber=11134766","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T17:33:06Z","timestamp":1757698386000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11134766\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/ojcs.2025.3602355","relation":{},"ISSN":["2644-1268"],"issn-type":[{"type":"electronic","value":"2644-1268"}],"subject":[],"published":{"date-parts":[[2025]]}}}