{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:28:01Z","timestamp":1778300881397,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540440116","type":"print"},{"value":"9783540706595","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-70659-3_57","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T07:47:11Z","timestamp":1180165631000},"page":"548-556","source":"Crossref","is-referenced-by-count":14,"title":["Training Set Expansion in Handwritten Character Recognition"],"prefix":"10.1007","author":[{"given":"Javier","family":"Cano","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan-Carlos","family":"Perez-Cortes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joaquim","family":"Arlandis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafael","family":"Llobet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,21]]},"reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S. Arya","year":"1998","unstructured":"S. Arya, D. M. Mount, N. S. Netanyahu, R. Silverman, and A. Wu. An optimal algorithm for approximate nearest neighbor searching. Journal of the ACM, 45:891\u2013923, 1998.","journal-title":"Journal of the ACM"},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, B. W. Weide, and A. C. Yao. Optimal expected time algorithms for closest point problems. ACM Trans. on Math. Software, 6:563\u2013580, 1980.","journal-title":"ACM Trans. on Math. Software"},{"key":"57_CR3","first-page":"72","volume-title":"Proceedings of the 5th International Conference on Pattern Recognition","author":"P. A. Devijver","year":"1980","unstructured":"P. A. Devijver and J. Kittler. On the edited nearest neighbour rule. In Proceedings of the 5th International Conference on Pattern Recognition, pages 72\u201380. IEEE Computer Society Press, Los Alamitos, CA, 1980."},{"key":"57_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/355744.355745","volume":"3","author":"J. H. Friedman","year":"1977","unstructured":"J. H. Friedman, J. L. Bentley, and R. A. Finkel. An algorithm finding best matches in logarithmic expected time. ACM Trans. Math. Software, 3:209\u2013226, 1977.","journal-title":"ACM Trans. Math. Software"},{"issue":"5","key":"57_CR5","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/34.589216","volume":"19","author":"T. M. Ha","year":"1997","unstructured":"T. M. Ha and H. Bunke. Off-line, handwritten numeral recognition by perturbation method. IEEE Trans. on PAMI, 19(5):535\u2013539, May 1997.","journal-title":"IEEE Trans. on PAMI"},{"key":"57_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TIT.1968.1054155","volume":"125","author":"P. E. Hart","year":"1968","unstructured":"P. E. Hart. The condensed nearest neighbor rule. IEEE Trans. on Information Theory, 125:515\u2013516, 1968.","journal-title":"IEEE Trans. on Information Theory"},{"key":"57_CR7","first-page":"268","volume":"18","author":"A. Jain","year":"1996","unstructured":"A. Jain. Object matching using deformable templates. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:268\u2013273, 1996.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"57_CR8","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/TPAMI.1986.4767859","volume":"8","author":"B. S. Kim","year":"1986","unstructured":"B. S. Kim and S. B. Park. A fast k nearest neighbor finding algorithm based on the ordered partition. IEEE Trans. on PAMI, 8:761\u2013766, 1986.","journal-title":"IEEE Trans. on PAMI"},{"key":"57_CR9","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/S0167-8655(97)00137-2","volume":"18","author":"J. Mao","year":"1997","unstructured":"Jianchang Mao. Improving ocr performance using character degradation models and boosting algorithm. Pattern Recognition Letters, 18:1415\u20131419, 1997.","journal-title":"Pattern Recognition Letters"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"J. C. Perez-Cortes, J. Arlandis Arlandis, and R. Llobet. Fast and accurate handwritten character recognition using approximate nearest neighbours search on large databases. In Workshop on Statistical Pattern Recognition SPR-2000, Alicante (Spain), 2000.","DOI":"10.1007\/3-540-44522-6_79"},{"issue":"9","key":"57_CR11","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1109\/34.310689","volume":"16","author":"S. J. Smith","year":"1994","unstructured":"S. J. Smith. Handwritten character classification using nearest neighbor in large databases. IEEE Trans. on PAMI, 16(9):915\u2013919, September 1994.","journal-title":"IEEE Trans. on PAMI"},{"key":"57_CR12","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D. L. Wilson","year":"1972","unstructured":"D. L. Wilson. Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. on Systems, Man and Cybernetics, 2:408\u2013420, 1972.","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"}],"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_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T00:02:04Z","timestamp":1550361724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-70659-3_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440116","9783540706595"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-70659-3_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}