{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,2]],"date-time":"2025-03-02T05:47:23Z","timestamp":1740894443776,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261544"},{"type":"electronic","value":"9783540322382"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11492542_1","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:04:07Z","timestamp":1294455847000},"page":"3-10","source":"Crossref","is-referenced-by-count":0,"title":["Testing Some Improvements of the Fukunaga and Narendra\u2019s Fast Nearest Neighbour Search Algorithm in a Spelling Task"],"prefix":"10.1007","author":[{"given":"Eva","family":"G\u00f3mez-Ballester","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":[{"key":"1_CR1","volume-title":"Nearest Neighbour(NN) Norms: NN Pattern Classification Techniques","author":"B.V. Dasarathy","year":"1991","unstructured":"Dasarathy, B.V.: Nearest Neighbour(NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos (1991)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Chen, Y.S., Hung, Y.P., Fuh, C.S.: Fast Algorithm for Nearest Neighbour Search Based on a Lower Bound Tree. In: Proceedings of the 8th International Conference on Computer Vision, Vancouver, Canada, vol.\u00a01, pp. 446\u2013453 (2001)","DOI":"10.1109\/ICCV.2001.937551"},{"key":"1_CR3","volume-title":"Pattern Classification and Scene Analysis","author":"R. Duda","year":"1973","unstructured":"Duda, R., Hart, P.: Pattern Classification and Scene Analysis. Wiley, Chichester (1973)"},{"key":"1_CR4","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\u2013 nearest neighbours. IEEE Trans. Computing\u00a024, 750\u2013753 (1975)","journal-title":"IEEE Trans. Computing"},{"key":"1_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\u00a09, 631\u2013634 (1983)","journal-title":"IEEE Trans. Software Engineering"},{"key":"1_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\u00a017, 731\u2013739 (1996)","journal-title":"Pattern Recognition Letters"},{"key":"1_CR7","unstructured":"Alinat, P.: Periodic progress report 4, ROARS project ESPRIT II - Number 5516. Thomson Technical Report TS ASM 93\/S\/EGS\/NC\/079 (1993)"},{"issue":"6","key":"1_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/(SICI)1520-684X(200006)31:6<1::AID-SCJ1>3.0.CO;2-C","volume":"31","author":"S. Omachi","year":"2000","unstructured":"Omachi, S., Aso, H.: A fast algorithm for a k-NN classifier based on branch and bound method and computational quantity estimation. Systems and Computers in Japan\u00a031(6), 1\u20139 (2000)","journal-title":"Systems and Computers in Japan"},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.227","volume":"3","author":"I. Geofrey","year":"1995","unstructured":"Geofrey, I.: Webb: OPUS: An Efficient Admissible Algorithm for Unordered Search. Journal of Artificial Intelligence Research\u00a03, 431\u2013465 (1995)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0167-8655(85)90036-4","volume":"3","author":"B. Kamgar-Parsi","year":"1985","unstructured":"Kamgar-Parsi, B., Kanal, L.: An improved branch and bound algorithm for computing k-nearest neighbors. Pattern Recognition Letters\u00a03, 7\u201312 (1985)","journal-title":"Pattern Recognition Letters"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24586-5_56","volume-title":"Progress in Pattern Recognition, Speech and Image Analysis","author":"E. G\u00f3mez-Ballester","year":"2003","unstructured":"G\u00f3mez-Ballester, E., Mic\u00f3, L., Oncina, J.: Some improvements in tree based nearest neighbour algorithms. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol.\u00a02905, pp. 456\u2013463. Springer, Heidelberg (2003)"}],"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\/11492542_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T14:51:59Z","timestamp":1740840719000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11492542_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261544","9783540322382"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11492542_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}