{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:29:51Z","timestamp":1725568191852},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540402176"},{"type":"electronic","value":"9783540448716"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"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":[[2003]]},"DOI":"10.1007\/978-3-540-44871-6_95","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T10:17:11Z","timestamp":1288088231000},"page":"821-828","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Some Results about the Use of Tree\/String Edit Distances in a~Nearest Neighbour Classification Task"],"prefix":"10.1007","author":[{"given":"Juan Ram\u00f3n","family":"Rico-Juan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,9,18]]},"reference":[{"key":"95_CR1","volume-title":"Vector quantization and signal compression","author":"A. Gersho","year":"1991","unstructured":"Gersho, A., Gray, R.M.: Vector quantization and signal compression. Kluwer Academic Publishers, Dordrecht (1991)"},{"unstructured":"Hastie, T., Tibshirani, R.: Classification by pairwise coupling. Technical report, Stanford University and University of Toronto (1996)","key":"95_CR2"},{"key":"95_CR3","volume-title":"Introduction to Modern Information Retrieval","author":"G. Salton","year":"1983","unstructured":"Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw Hill, New York (1983)"},{"issue":"1","key":"95_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","volume":"15","author":"E. Vidal","year":"1994","unstructured":"Vidal, E.: New formulation and improvements of the Nearest-Neighbour approximating and eliminating search algorithm(AESA). Pattern Recognition Letters\u00a015(1), 1\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"key":"95_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","volume":"15","author":"L. Mic\u00f3","year":"1994","unstructured":"Mic\u00f3, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating searh algorithm with linear preprocessing-time and memory requirements. Pattern Recognition Letters\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"7","key":"95_CR6","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1109\/T-C.1975.224297","volume":"24","author":"K. Fukunaga","year":"1975","unstructured":"Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbours. IEEE Transactions on Computers\u00a024(7), 750\u2013753 (1975)","journal-title":"IEEE Transactions on Computers"},{"key":"95_CR7","first-page":"141","volume-title":"String Processing and Information Retrieval Symposium and International Workshop on Groupware","author":"G. Navarro","year":"1999","unstructured":"Navarro, G.: String Processing and Information Retrieval Symposium and International Workshop on Groupware, pp. 141\u2013148. IEEE Press, Los Alamitos (1999)"},{"issue":"9","key":"95_CR8","first-page":"1427","volume":"24","author":"J.R. Rico-Juan","year":"2003","unstructured":"Rico-Juan, J.R., Mic\u00f3, L.: Comparison of AESA and LAESA search algorithms using string and tree edit distances. Pattern Recognition Letters\u00a024(9), 1427\u20131436 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"95_CR9","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/0167-8655(95)00121-V","volume":"16","author":"R.C. Carrasco","year":"1995","unstructured":"Carrasco, R.C., Forcada, M.L.: A note on the Nagendraprasad-Wang-Gupta thinning algorithm. Pattern Recognition Letters\u00a016, 539\u2013541 (1995)","journal-title":"Pattern Recognition Letters"},{"key":"95_CR10","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K. Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing\u00a018, 1245\u20131262 (1989)","journal-title":"SIAM Journal of Computing"},{"key":"95_CR11","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. J. ACM\u00a021, 168\u2013173 (1974)","journal-title":"J. ACM"},{"key":"95_CR12","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1016\/0167-6393(88)90059-3","volume":"7","author":"E. Vidal","year":"1988","unstructured":"Vidal, E., Lloret, M.J.: Fast speaker independent DTW recognition of isolated words using a metric-space search algorithm (AESA). Speech Communication\u00a07, 417\u2013422 (1988)","journal-title":"Speech Communication"},{"key":"95_CR13","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1016\/S0167-8655(98)00007-5","volume":"19","author":"L. Mic\u00f3","year":"1998","unstructured":"Mic\u00f3, L., Oncina, J.: Comparison of fast nearest neighbour classifiers for handwritten character recognition. Pattern Recognition Letters\u00a019, 351\u2013356 (1998)","journal-title":"Pattern Recognition Letters"},{"key":"95_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0167-6393(85)90058-5","volume":"4","author":"E. Vidal","year":"1985","unstructured":"Vidal, E., Casacuberta, F., Rulot, H.: Is the DTW distance really a metric? an algorithm reducing the number of dtw comparisons in isolated words. Speech Communication\u00a04, 333\u2013344 (1985)","journal-title":"Speech Communication"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-44871-6_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,10]],"date-time":"2020-02-10T04:11:53Z","timestamp":1581307913000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-44871-6_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402176","9783540448716"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-44871-6_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"18 September 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}