{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T15:30:22Z","timestamp":1773329422481,"version":"3.50.1"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030022235","type":"print"},{"value":"9783030022242","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-02224-2_10","type":"book-chapter","created":{"date-parts":[[2018,10,3]],"date-time":"2018-10-03T10:34:07Z","timestamp":1538562847000},"page":"122-133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New Permutation Dissimilarity Measures 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":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9943-2510","authenticated-orcid":false,"given":"Rodrigo","family":"Paredes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7630-3161","authenticated-orcid":false,"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,4]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1016\/j.is.2015.01.010","volume":"52","author":"G Amato","year":"2015","unstructured":"Amato, G., Esuli, A., Falchi, F.: A comparison of pivot selection techniques for permutation-based indexing. Inf. Syst. 52, 176\u2013188 (2015). https:\/\/doi.org\/10.1016\/j.is.2015.01.010","journal-title":"Inf. Syst."},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Amato, G., Savino, P.: Approximate similarity search in metric spaces using inverted files. In: 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":"10_CR3","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":"10_CR4","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":"10_CR5","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":"10_CR6","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":"10_CR7","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":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/j.ipm.2010.11.011","volume":"48","author":"A Esuli","year":"2012","unstructured":"Esuli, A.: Use of permutation prefixes for efficient and scalable approximate similarity search. Inf. Process. Manage. 48(5), 889\u2013902 (2012). https:\/\/doi.org\/10.1016\/j.ipm.2010.11.011","journal-title":"Inf. Process. Manage."},{"issue":"1","key":"10_CR9","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":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-41062-8_6","volume-title":"Similarity Search and Applications","author":"K Figueroa","year":"2013","unstructured":"Figueroa, K., Paredes, R.: List of clustered permutations for proximity searching. In: Brisaboa, N., Pedreira, O., Zezula, P. (eds.) SISAP 2013. LNCS, vol. 8199, pp. 50\u201358. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41062-8_6"},{"key":"10_CR11","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007). http:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-319-59226-8_8","volume-title":"Pattern Recognition","author":"K Figueroa","year":"2017","unstructured":"Figueroa, K., Paredes, R., Camarena-Ibarrola, J.A., Reyes, N.: Fixed height queries tree permutation index for proximity searching. In: Carrasco-Ochoa, J.A., Mart\u00ednez-Trinidad, J.F., Olvera-L\u00f3pez, J.A. (eds.) MCPR 2017. LNCS, vol. 10267, pp. 74\u201383. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59226-8_8"},{"issue":"4","key":"10_CR13","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":"10_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.is.2015.01.009","volume":"52","author":"H Mohamed","year":"2015","unstructured":"Mohamed, H., Marchand-Maillet, S.: Quantized ranking for permutation-based indexing. Inf. Syst. 52, 163\u2013175 (2015). https:\/\/doi.org\/10.1016\/j.is.2015.01.009","journal-title":"Inf. Syst."},{"issue":"12","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1618","DOI":"10.14778\/2824032.2824059","volume":"8","author":"B Naidan","year":"2015","unstructured":"Naidan, B., Boytsov, L., Nyberg, E.: Permutation search methods are efficient, yet faster search is possible. Proc. VLDB Endow. 8(12), 1618\u20131629 (2015). https:\/\/doi.org\/10.14778\/2824032.2824059","journal-title":"Proc. VLDB Endow."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jda.2008.09.014","volume":"7","author":"M Patella","year":"2009","unstructured":"Patella, M., Ciaccia, P.: Approximate similarity search: a multi-faceted problem. J. Discret Algorithms 7(1), 36\u201348 (2009). https:\/\/doi.org\/10.1016\/j.jda.2008.09.014. Selected papers from the 1st International Workshop on Similarity Search and Applications (SISAP)","journal-title":"J. Discret Algorithms"},{"key":"10_CR17","volume-title":"Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)","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":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/11687238_43","volume-title":"Advances in Database Technology - EDBT 2006","author":"T Skopal","year":"2006","unstructured":"Skopal, T.: On fast non-metric similarity search by metric access methods. In: Ioannidi, Y., et al. (eds.) EDBT 2006. LNCS, vol. 3896, pp. 718\u2013736. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11687238_43"},{"issue":"7","key":"10_CR19","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/j.is.2012.06.005","volume":"38","author":"ES Tellez","year":"2013","unstructured":"Tellez, E.S., Chavez, E., Navarro, G.: Succint nearest neighbor search. Inf. Syst. 38(7), 1019\u20131030 (2013)","journal-title":"Inf. Syst."},{"key":"10_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29151-2","volume-title":"Similarity Search: The Metric Space Approach, Advances in Database Systems","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). https:\/\/doi.org\/10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-02224-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T23:59:37Z","timestamp":1720655977000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-02224-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030022235","9783030022242"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-02224-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"4 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}