{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:28:52Z","timestamp":1743136132663,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"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_69","type":"book-chapter","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T14:17:11Z","timestamp":1288102631000},"page":"589-597","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Extending Fast Nearest Neighbour Search Algorithms for Approximate k-NN Classification"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Moreno-Seco","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","published-online":{"date-parts":[[2003,9,18]]},"reference":[{"key":"69_CR1","unstructured":"Alinat, P.: Periodic progress report 4, ROARS project ESPRIT II - Number 5516. Thomson Technical Report TS ASM 93\/S\/EGS\/NC\/079 (1993)"},{"key":"69_CR2","unstructured":"Brin, S.: Near Neighbor Search in Large Metric Spaces. In: Proceedings of the 21st VLDB Conference, pp. 574\u2013584 (1995)"},{"key":"69_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":"69_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J.H. Friedman","year":"1977","unstructured":"Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software\u00a03, 209\u2013226 (1977)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"69_CR5","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-nearest neighbors. IEEE Trans. Computing\u00a024, 750\u2013753 (1975)","journal-title":"IEEE Trans. Computing"},{"key":"69_CR6","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1002\/cyto.990110105","volume":"11","author":"E. Granum","year":"1990","unstructured":"Granum, E., Thomason, M.G.: Automatically inferred Markov network models for classification of chromosomal band pattern structures. Cytometry\u00a011, 26\u201339 (1990)","journal-title":"Cytometry"},{"key":"69_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-642-74738-0_18","volume-title":"Automation of Cytogenetics","author":"E. Granum","year":"1989","unstructured":"Granum, E., Thomason, M.G., Gregor, J.: On the use of automatically inferred Markov networks for chromosome analysis. In: Lundsteen, C., Piper, J. (eds.) Automation of Cytogenetics, pp. 233\u2013251. Springer, Heidelberg (1989)"},{"key":"69_CR8","volume-title":"Algorithms for clustering data","author":"A.K. Jain","year":"1988","unstructured":"Jain, A.K., Dubes, R.C.: Algorithms for clustering data. Prentice-Hall, Englewood Cliffs (1988)"},{"key":"69_CR9","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1111\/j.1399-0004.1980.tb02296.x","volume":"18","author":"C. Lundsteen","year":"1980","unstructured":"Lundsteen, C., Phillip, J., Granum, E.: Quantitative analysis of 6985 digitized trypsin G-banded human metaphase chromosomes. Clinical Genetics\u00a018, 355\u2013370 (1980)","journal-title":"Clinical Genetics"},{"key":"69_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1007\/3-540-70659-3_75","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"F. Moreno-Seco","year":"2002","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: Extending LAESA fast nearest neighbour algorithm to find the k nearest neighbours. In: Caelli, T.M., Amin, A., Duin, R.P.W., Kamel, M.S., de Ridder, D. (eds.) SPR 2002 and SSPR 2002. LNCS, vol.\u00a02396, pp. 691\u2013699. Springer, Heidelberg (2002)"},{"issue":"1-3","key":"69_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-8655(02)00187-3","volume":"24","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: A modification of the LAESA algorithm for approximated k-NN classification. Pattern Recognition Letters\u00a024(1-3), 47\u201353 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"69_CR12","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":"69_CR13","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\u00a015, 9\u201317 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"9","key":"69_CR14","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1109\/34.615448","volume":"19","author":"S. Nene","year":"1997","unstructured":"Nene, S., Nayar, S.: A Simple Algorithm for Nearest Neighbor Search in High Dimensions. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a019(9), 989\u20131003 (1997)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"69_CR15","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1016\/S0031-3203(99)00134-X","volume":"33","author":"R. Ramasubramanian","year":"2000","unstructured":"Ramasubramanian, R., Paliwal, K.K.: Fast nearest-neighbor search algorithms based on approximation-elimination search. Pattern Recognition\u00a033, 1497\u20131510 (2000)","journal-title":"Pattern Recognition"},{"key":"69_CR16","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\u20137 (1994)","journal-title":"Pattern Recognition Letters"},{"issue":"1","key":"69_CR17","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 Association for Computing Machinery\u00a021(1), 168\u2013173 (1974)","journal-title":"Journal of the Association for Computing Machinery"},{"key":"69_CR18","unstructured":"Yianilos, P.N.: Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 311\u2013321 (1993)"},{"key":"69_CR19","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"}],"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_69","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T12:03:45Z","timestamp":1583755425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-44871-6_69"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540402176","9783540448716"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-44871-6_69","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"}}]}}