{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:33Z","timestamp":1742913393189,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642244704"},{"type":"electronic","value":"9783642244711"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24471-1_12","type":"book-chapter","created":{"date-parts":[[2011,9,24]],"date-time":"2011-09-24T01:49:06Z","timestamp":1316828946000},"page":"163-176","source":"Crossref","is-referenced-by-count":1,"title":["Impact of the Initialization in Tree-Based Fast Similarity Search Techniques"],"prefix":"10.1007","author":[{"given":"Aureo","family":"Serrano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/328939.328959","volume":"24","author":"T. Bozkaya","year":"1999","unstructured":"Bozkaya, T., \u00d6zsoyoglu, Z.M.: Indexing large metric spaces for similarity search queries. ACM Trans. Database Syst.\u00a024(3), 361\u2013404 (1999)","journal-title":"ACM Trans. Database Syst."},{"key":"12_CR2","unstructured":"Brin, S.: Near neighbor search in large metric spaces. In: Proceedings of the 21st International Conference on Very Large Data Bases, pp. 574\u2013584 (1995)"},{"issue":"3","key":"12_CR3","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., Marroquin, J.L.: Searching in metric spaces. ACM Computing Surveys\u00a033(3), 273\u2013321 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.patcog.2005.06.007","volume":"39","author":"E. G\u00f3mez-Ballester","year":"2006","unstructured":"G\u00f3mez-Ballester, E., Mic\u00f3, L., Oncina, J.: Some approaches to improve tree-based nearest neighbour search algorithms. Pattern Recognition\u00a039(2), 171\u2013179 (2006)","journal-title":"Pattern Recognition"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/223784.223812","volume-title":"Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, SIGMOD 1995","author":"C. Faloutsos","year":"1995","unstructured":"Faloutsos, C., Lin, K.: Fastmap: a fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In: Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, SIGMOD 1995, pp. 163\u2013174. ACM, New York (1995)"},{"key":"12_CR6","unstructured":"Freeman, H.: Boundary encoding and processing. Picture Processing and Psychopictorics, 241\u2013266 (1970)"},{"issue":"4","key":"12_CR7","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. ACM Trans. Database Syst.\u00a028(4), 517\u2013580 (2003)","journal-title":"ACM Trans. Database Syst."},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/TSE.1983.235263","volume":"9","author":"I. Kalantari","year":"1983","unstructured":"Kalantari, I., McDonald, G.: A data structure and an algorithm for the nearest point problem. IEEE Trans. Software Engineering\u00a09, 631\u2013634 (1983)","journal-title":"IEEE Trans. Software Engineering"},{"issue":"4","key":"12_CR9","first-page":"845","volume":"163","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Binary codes capable of correcting deletions, insertions, and reversals. Doklady Akademii Nauk\u00a0163(4), 845\u2013848 (1965)","journal-title":"Doklady Akademii Nauk"},{"key":"12_CR10","first-page":"2089","volume":"62","author":"C. Merkwirth","year":"2000","unstructured":"Merkwirth, C., Parlitz, U., Lauterborn, W.: Fast nearest-neighbor searching for nonlinear signal processing. Physical Review\u00a062, 2089\u20132097 (2000)","journal-title":"Physical Review"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1016\/0167-8655(96)00032-3","volume":"17","author":"L. Mic\u00f3","year":"1996","unstructured":"Mic\u00f3, L., Oncina, J., Carrasco, R.C.: A fast branch and bound nearest neighbor classifier in metric spaces. Pattern Recognition Letters\u00a017, 731\u2013773 (1996)","journal-title":"Pattern Recognition Letters"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1227161.1322337","volume":"12","author":"G. Navarro","year":"2008","unstructured":"Navarro, G., Reyes, N.: Dynamic spatial approximation trees. J. Exp. Algorithmics\u00a012, 1\u201368 (2008)","journal-title":"J. Exp. Algorithmics"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-55488-2_27","volume-title":"Data Structures and Efficient Algorithms","author":"H. Noltemeier","year":"1992","unstructured":"Noltemeier, H., Verbarg, K., Zirkelbach, C.: Monotonous bisector* trees \u2013 a tool for efficient partitioning of complex scenes of geometric objects. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol.\u00a0594, pp. 186\u2013203. Springer, Heidelberg (1992)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1145\/359581.359599","volume":"20","author":"M. Shapiro","year":"1977","unstructured":"Shapiro, M.: The choice of reference points in best-match file searching. Commun. ACM\u00a020, 339\u2013343 (1977)","journal-title":"Commun. ACM"},{"issue":"4","key":"12_CR15","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"J.K. Uhlmann","year":"1991","unstructured":"Uhlmann, J.K.: Satisfying general proximity\/similarity queries with metric trees. Inf. Process. Lett.\u00a040(4), 175\u2013179 (1991)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of the ACM\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"key":"12_CR17","unstructured":"Yianilos, P.N.: Data structures and algorithms for nearest neighbor search in general metric spaces. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)"},{"key":"12_CR18","doi-asserted-by":"crossref","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. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Similarity-Based Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24471-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T06:01:43Z","timestamp":1560664903000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24471-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642244704","9783642244711"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24471-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}