{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:40:22Z","timestamp":1743622822258,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311482"},{"type":"electronic","value":"9783642311499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31149-9_19","type":"book-chapter","created":{"date-parts":[[2012,6,27]],"date-time":"2012-06-27T15:44:47Z","timestamp":1340811887000},"page":"187-196","source":"Crossref","is-referenced-by-count":3,"title":["The List of Clusters Revisited"],"prefix":"10.1007","author":[{"given":"Eric","family":"Sadit Tellez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edgar","family":"Ch\u00e1vez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"19_CR1","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.L.: Searching in metric spaces. ACM Comput. Surv.\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Comput. Surv."},{"key":"19_CR2","unstructured":"Samet, H.: Foundations of Multidimensional and Metric Data Structures, 1st edn. The Morgan Kaufman Series in Computer Graphics and Geometic Modeling. Morgan Kaufmann Publishers, University of Maryland at College Park (2006)"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/958942.958948","volume":"28","author":"G.R. Hjaltason","year":"2003","unstructured":"Hjaltason, G.R., Samet, H.: Index-driven similarity search in metric spaces (survey article). ACM Trans. Database Syst.\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E. Vidal Ruiz","year":"2005","unstructured":"Vidal Ruiz, E.: An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recognition Letters\u00a04, 145\u2013157 (2005)","journal-title":"Pattern Recognition Letters"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"M.L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, M.L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating search algorithm (aesa) with linear preprocessing time and memory requirements. Pattern Recogn. Lett.\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recogn. Lett."},{"issue":"2","key":"19_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1023\/A:1011343115154","volume":"14","author":"E. Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Marroquin, J., Navarro, G.: Fixed queries array: A fast and economical data structure for proximity searching. Multimedia Tools and Applications (MTAP)\u00a014(2), 113\u2013135 (2001)","journal-title":"Multimedia Tools and Applications (MTAP)"},{"key":"19_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-540-24694-7_23","volume-title":"MICAI 2004: Advances in Artificial Intelligence","author":"E. Ch\u00e1vez","year":"2004","unstructured":"Ch\u00e1vez, E., Figueroa, K.: Faster Proximity Searching in Metric Data. In: Monroy, R., Arroyo-Figueroa, G., Sucar, L.E., Sossa, H. (eds.) MICAI 2004. LNCS (LNAI), vol.\u00a02972, pp. 222\u2013231. Springer, Heidelberg (2004)"},{"key":"19_CR8","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.\u00a026, 1363\u20131376 (2005)","journal-title":"Pattern Recogn. Lett."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Navarro, G.: Fast approximate string matching in a dictionary. In: Proc. 5th International Symposium on String Processing and Information Retrieval (SPIRE), pp. 14\u201322. IEEE CS Press (1998)","DOI":"10.1109\/SPIRE.1998.712978"},{"issue":"4","key":"19_CR10","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J. Uhlmann","year":"1991","unstructured":"Uhlmann, J.: Satisfying general proximity\/similarity queries with metric trees. Information Processing Letters\u00a040(4), 175\u2013179 (1991)","journal-title":"Information Processing Letters"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/362003.362025","volume":"16","author":"W. Burkhard","year":"1973","unstructured":"Burkhard, W., Keller, R.: Some approaches to best-match file searching. Communications of the ACM\u00a016(4), 230\u2013236 (1973)","journal-title":"Communications of the ACM"},{"key":"19_CR12","first-page":"574","volume-title":"Proceedings of the 21th International Conference on Very Large Data Bases, VLDB 1995","author":"S. Brin","year":"1995","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21th International Conference on Very Large Data Bases, VLDB 1995, pp. 574\u2013584. Morgan Kaufmann Publishers Inc., San Francisco (1995)"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/j.jda.2008.09.012","volume":"7","author":"R. Paredes","year":"2009","unstructured":"Paredes, R., Reyes, N.: Solving similarity joins and range queries in metric spaces with the list of twin clusters. J. of Discrete Algorithms\u00a07, 18\u201335 (2009)","journal-title":"J. of Discrete Algorithms"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31149-9_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T19:14:19Z","timestamp":1743621259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31149-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311482","9783642311499"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31149-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}