{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:40:08Z","timestamp":1750027208158,"version":"3.41.0"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030770037"},{"type":"electronic","value":"9783030770044"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-77004-4_9","type":"book-chapter","created":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T23:06:10Z","timestamp":1623798370000},"page":"89-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortening the Candidate List for Similarity Searching Using Inverted Index"],"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-0001-7630-3161","authenticated-orcid":false,"given":"Nora","family":"Reyes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,6,16]]},"reference":[{"key":"9_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":"9_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":"9_CR3","doi-asserted-by":"publisher","first-page":"1363","DOI":"10.1016\/j.patrec.2004.11.014","volume":"26","author":"E Ch\u00e1vez","year":"2005","unstructured":"Ch\u00e1vez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recogn. Lett. 26(9), 1363\u20131376 (2005)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"9_CR4","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."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Ch\u00e1vez, E., Figueroa, K., Navarro, G.: Effective proximity retrieval by ordering permutations. IEEE Trans. Pattern Anal. Mach. Intell. (TPAMI) 30, 1647\u20131658 (2008). http:\/\/doi.ieeecomputersociety.org\/10.1109\/TPAMI.2007.70815","DOI":"10.1109\/TPAMI.2007.70815"},{"key":"9_CR6","unstructured":"Esuli, A.: PP-Index: using permutation prefixes for efficient and scalable approximate similarity search. In: LSDR-IR Workshop (2019)"},{"key":"9_CR7","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007). http:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-030-60887-3_3","volume-title":"Advances in Computational Intelligence","author":"K Figueroa","year":"2020","unstructured":"Figueroa, K., Reyes, N., Camarena-Ibarrola, A.: Candidate list obtained from metric inverted index for similarity searching. In: Mart\u00ednez-Villase\u00f1or, L., Herrera-Alc\u00e1ntara, O., Ponce, H., Castro-Espinoza, F.A. (eds.) MICAI 2020. LNCS (LNAI), vol. 12469, pp. 29\u201338. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-60887-3_3"},{"key":"9_CR9","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":"1","key":"9_CR10","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. Discrete Algorithms 7(1), 36\u201348 (2009)","journal-title":"J. Discrete Algorithms"},{"key":"9_CR11","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures. The Morgan Kaufman Series in Computer Graphics and Geometic Modeling, 1st edn. Morgan Kaufmann Publishers, University of Maryland at College Park (2006)"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Skala, M.: Counting distance permutations. J. Discrete Algorithms 7(1), 49\u201361 (2009). https:\/\/doi.org\/10.1016\/j.jda.2008.09.011","DOI":"10.1016\/j.jda.2008.09.011"},{"key":"9_CR13","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. Springer, Boston (2006). https:\/\/doi.org\/10.1007\/0-387-29151-2"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-77004-4_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,15]],"date-time":"2025-06-15T22:02:25Z","timestamp":1750024945000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-77004-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030770037","9783030770044"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-77004-4_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MCPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexican Conference on Pattern Recognition","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico City","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mcpr22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ccc.inaoep.mx\/~mcpr\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.706","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.308","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}