{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:28:44Z","timestamp":1761629324668},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440116"},{"type":"electronic","value":"9783540706595"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-70659-3_75","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T07:47:11Z","timestamp":1180165631000},"page":"718-724","source":"Crossref","is-referenced-by-count":9,"title":["Extending LAESA Fast Nearest Neighbour Algorithm to Find the k Nearest Neighbours"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Moreno-Seco","sequence":"first","affiliation":[]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[]},{"given":"Jose","family":"Oncina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"key":"75_CR1","unstructured":"Aibar, P., Juan, A., Vidal, E.: Extensions to the approximating and eliminating search algorithm (AESA) for finding k-nearest-neighbours. New Advances and Trends in Speech Recognition and Coding (1993) 23\u201328"},{"key":"75_CR2","unstructured":"Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley (1973)"},{"key":"75_CR3","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, M.: A branch and bound algorithm for computing k\u2014 nearest neighbors. IEEE Trans. Computing (1975) 24 750\u2013753","journal-title":"IEEE Trans. Computing"},{"key":"75_CR4","unstructured":"Jain, A. K., Dubes, R. C.: Algorithms for clustering data. Prentice-Hall (1988)"},{"key":"75_CR5","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 (1983) 9 631\u2013634","journal-title":"IEEE Trans. Software Engineering"},{"key":"75_CR6","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 neighbour classifier in metric spaces. Pattern Recognition Letters (1996) 17 731\u2013739","journal-title":"Pattern Recognition Letters"},{"key":"75_CR7","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 search algorithm (AESA) with linear preprocessing-time and memory requirements. Pattern Recognition Letters (1994) 15 9\u201317","journal-title":"Pattern Recognition Letters"},{"key":"75_CR8","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 (1994) 15 1\u20137","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"75_CR9","doi-asserted-by":"crossref","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 Association for Computing Machinery (1974) 21(1) 168\u2013173","journal-title":"Journal of the Association for Computing Machinery"},{"key":"75_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 (1989) 18 1245\u20131262","journal-title":"SIAM Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-70659-3_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T23:42:15Z","timestamp":1550360535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-70659-3_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440116","9783540706595"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-70659-3_75","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}