{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:51:49Z","timestamp":1770281509083,"version":"3.49.0"},"reference-count":14,"publisher":"SAGE Publications","issue":"5","license":[{"start":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:00:00Z","timestamp":1555286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent & Fuzzy Systems"],"published-print":{"date-parts":[[2019,5,14]]},"abstract":"\n \u00a0Similarity searching is the core of many applications in artificial intelligence since it solves problems like nearest neighbor searching. A common approach to similarity searching consists in mapping the database to a\n metric space<\/jats:italic>\n in order to build an index that allows for fast searching. One of the most powerful searching algorithms for high dimensional data is known as the\n permutation based algorithm (PBA)<\/jats:italic>\n . However, PBA has to collect the most similar permutations to a given query\u2019s permutation. In this paper, how to speed up this process by proposing several novel hash functions for\n Locality Sensitive Hashing (LSH)<\/jats:italic>\n with PBA is shown. As a matter of fact, at searching our technique allows discarding up to 50% of the database to answer the query with a candidate list obtained in constant time.\n <\/jats:p>","DOI":"10.3233\/jifs-179017","type":"journal-article","created":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T17:10:37Z","timestamp":1555434637000},"page":"4677-4684","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["Locality-sensitive hashing of permutations for proximity searching"],"prefix":"10.1177","volume":"36","author":[{"given":"Karina","family":"Figueroa","sequence":"first","affiliation":[{"name":"Ciudad Universitaria, Facultad de Ciencias F\u00edsico-Matem\u00e1ticas, Universidad Michoacana, Morelia, Michoac\u00e1n, Mexico"}]},{"given":"Antonio","family":"Camarena-Ibarrola","sequence":"additional","affiliation":[{"name":"Universidad Michoacana, Facultad de Ing, El\u00e9ctrica, Morelia, Michoac\u00e1n Mexico"}]},{"given":"Luis","family":"Valero-Elizondo","sequence":"additional","affiliation":[{"name":"Ciudad Universitaria, Facultad de Ciencias F\u00edsico-Matem\u00e1ticas, Universidad Michoacana, Morelia, Michoac\u00e1n, Mexico"}]},{"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[{"name":"Universidad Nacional de San Luis, San Luis, Argentina"}]}],"member":"179","published-online":{"date-parts":[[2019,4,15]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44808-X_12"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.70815"},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.11.011"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07491-7_11"},{"key":"e_1_3_1_8_2","unstructured":"FigueroaK. NavarroG. Ch\u00e1vezE. Metric spaces library 2007. Available at http:\/\/www.sisap.org\/Metric_Space_Library.html."},{"key":"e_1_3_1_9_2","first-page":"518","volume-title":"VLDB\u201999 Proceedings of the 25th International Converence on Very Large Data Bases","author":"Gionis A.","year":"1999","unstructured":"GionisA., IndykP. and MotwaniR., Similarity search in high dimensions via hashing, VLDB\u201999 Proceedings of the 25th International Converence on Very Large Data Bases, 1999, pp. 518\u2013529."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2016.06.004"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/SISAP.2009.26"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1862344.1862354"},{"key":"e_1_3_1_13_2","volume-title":"Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)","author":"Samet H.","year":"2005","unstructured":"SametH., Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2005. ISBN 0123694469."},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/1862344.1862355"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2"}],"container-title":["Journal of Intelligent & Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179017","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-179017","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-179017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T18:49:49Z","timestamp":1770230989000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-179017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,15]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5,14]]}},"alternative-id":["10.3233\/JIFS-179017"],"URL":"https:\/\/doi.org\/10.3233\/jifs-179017","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,15]]}}}