{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:57Z","timestamp":1740099597779,"version":"3.37.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337483"},{"type":"electronic","value":"9783030337490"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33749-0_21","type":"book-chapter","created":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T10:02:39Z","timestamp":1572084159000},"page":"251-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Sensitive Hashing for Proximity Searching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4680-5950","authenticated-orcid":false,"given":"Karina","family":"Figueroa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7610-3562","authenticated-orcid":false,"given":"Antonio","family":"Camarena-Ibarrola","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2850-0803","authenticated-orcid":false,"given":"Luis","family":"Valero-Elizondo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,27]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: Lempel, R., Perego, R., Silvestri, F. (eds.) 3rd International ICST Conference on Scalable Information Systems, INFOSCALE 2008, Vico Equense, Italy, 4\u20136 June 2008, p. 28. ICST\/ACM (2008). https:\/\/doi.org\/10.4108\/ICST.INFOSCALE2008.3486","DOI":"10.4108\/ICST.INFOSCALE2008.3486"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/11579427_41","volume-title":"MICAI 2005: Advances in Artificial Intelligence","author":"E Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Proximity searching in high dimensional spaces with a proximity preserving order. In: Gelbukh, A., de Albornoz, \u00c1., Terashima-Mar\u00edn, H. (eds.) MICAI 2005. LNCS (LNAI), vol. 3789, pp. 405\u2013414. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11579427_41"},{"issue":"9","key":"21_CR3","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1109\/TPAMI.2007.70815","volume":"30","author":"E Ch\u00e1vez","year":"2009","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 30(9), 1647\u20131658 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-44808-X_12","volume-title":"Algorithm Engineering and Experimentation","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G.: A probabilistic spell for the curse of dimensionality. In: Buchsbaum, A.L., Snoeyink, J. (eds.) ALENEX 2001. LNCS, vol. 2153, pp. 147\u2013160. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44808-X_12"},{"issue":"3","key":"21_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.: Proximity searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"21_CR6","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1111\/j.2517-6161.1977.tb01624.x","volume":"39","author":"P Diaconis","year":"1977","unstructured":"Diaconis, P., Graham, R.L.: Spearman\u2019s footrule as a measure of disarray. J. R. Stat. Soc. Ser. B (Methodol.) 39(2), 262\u2013268 (1977)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"issue":"1","key":"21_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1137\/S0895480102412856","volume":"17","author":"R Fagin","year":"2003","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. SIAM J. Discrete Math. 17(1), 134\u2013160 (2003)","journal-title":"SIAM J. Discrete Math."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"4677","DOI":"10.3233\/JIFS-179017","volume":"36","author":"K Figueroa","year":"2019","unstructured":"Figueroa, K., Camarena-Ibarrola, A., Valero-Elizondo, L., Reyes, N.: Locality-sensitive hashing of permutations for proximity searching. J. Intell. Fuzzy Syst. 36, 4677\u20134684 (2019)","journal-title":"J. Intell. Fuzzy Syst."},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-030-02224-2_10","volume-title":"Similarity Search and Applications","author":"K Figueroa","year":"2018","unstructured":"Figueroa, K., Paredes, R., Reyes, N.: New permutation dissimilarity measures for proximity searching. In: Marchand-Maillet, S., Silva, Y.N., Ch\u00e1vez, E. (eds.) SISAP 2018. LNCS, vol. 11223, pp. 122\u2013133. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02224-2_10"},{"key":"21_CR10","unstructured":"Gionis, A., Indyk, P., Motwani, R.: Similarity search in high dimensions via hashing. In: VLDB 1999 Proceedings of the 25th International Conference on Very Large Data Bases, pp. 518\u2013529 (1999)"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G Hjaltason","year":"2003","unstructured":"Hjaltason, G., Samet, H.: Index-driven similarity search in metric spaces. ACM Trans. Database Syst. 28(4), 517\u2013580 (2003). https:\/\/doi.org\/10.1145\/958942.958948","journal-title":"ACM Trans. Database Syst."},{"key":"21_CR12","series-title":"The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"H Samet","year":"2005","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling. Morgan Kaufmann Publishers Inc., San Francisco (2005)"},{"key":"21_CR13","doi-asserted-by":"publisher","unstructured":"Tellez, E.S., Chavez, E.: On locality sensitive hashing in metric spaces. In: Proceedings of the Third International Conference on Similarity Search and Applications, SISAP 2010, pp. 67\u201374. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1862344.1862355","DOI":"10.1145\/1862344.1862355"},{"key":"21_CR14","series-title":"Advances in Database Systems","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach","author":"P Zezula","year":"2006","unstructured":"Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach. Advances in Database Systems, vol. 32. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33749-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T20:24:22Z","timestamp":1721939062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33749-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337483","9783030337490"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33749-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"27 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MICAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican International Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xalapa","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"micai2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.micai.org\/2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}