{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T13:40:11Z","timestamp":1736602811963,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372363"},{"type":"electronic","value":"9783540372417"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11815921_82","type":"book-chapter","created":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T18:01:38Z","timestamp":1155060098000},"page":"747-754","source":"Crossref","is-referenced-by-count":0,"title":["On the Use of Different Classification Rules in an Editing Task"],"prefix":"10.1007","author":[{"given":"Luisa","family":"Mic\u00f3","sequence":"first","affiliation":[]},{"given":"Francisco","family":"Moreno-Seco","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Salvador","family":"S\u00e1nchez","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Martinez","family":"Sotoca","sequence":"additional","affiliation":[]},{"given":"Ram\u00f3n Alberto","family":"Mollineda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"82_CR1","doi-asserted-by":"crossref","unstructured":"Bernardo, E., Ho, T.-K.: On classifier domain of competence. In: Proc. 17th. Int. Conf. on Pattern Recognition, Cambridge, UK, pp. 136\u2013139 (2004)","DOI":"10.1109\/ICPR.2004.1334026"},{"key":"82_CR2","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D.L. Wilson","year":"1972","unstructured":"Wilson, D.L.: Asymptotic properties of nearest neighbour rules using edited data. IEEE Trans. on Systems, Man and Cybernetics\u00a02, 408\u2013421 (1972)","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"issue":"1","key":"82_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"IT-13","author":"T.M. Cover","year":"1967","unstructured":"Cover, T.M., Hart, P.E.: Nearest Neighbor Pattern Classification. IEEE Trans. on Information Theory\u00a0IT-13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. on Information Theory"},{"key":"82_CR4","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1016\/S0167-8655(02)00225-8","volume":"24","author":"J.S. S\u00e1nchez","year":"2003","unstructured":"S\u00e1nchez, J.S., et al.: Analysis of new techniques to obtain quality training sets. Pattern Recognition Letters\u00a024, 1015\u20131022 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"82_CR5","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":"82_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0167-8655(95)00093-3","volume":"17","author":"B.B. Chaudhuri","year":"1996","unstructured":"Chaudhuri, B.B.: A new definition of neighborhood of a point in multi-dimensional space. Pattern Recognition Letters\u00a017, 11\u201317 (1996)","journal-title":"Pattern Recognition Letters"},{"key":"82_CR7","volume-title":"Nearest Neighbor Norms: NN Pattern Classification techniques","author":"B.V. Dasarathy","year":"1991","unstructured":"Dasarathy, B.V.: Nearest Neighbor Norms: NN Pattern Classification techniques. IEEE Computer Society Press, Los Alamos (1991)"},{"key":"82_CR8","volume-title":"Pattern Recognition: A Statistical Approach","author":"P.A. Devijver","year":"1982","unstructured":"Devijver, P.A., Kittler, J.: Pattern Recognition: A Statistical Approach. Prentice Hall, Englewood Cliffs (1982)"},{"key":"82_CR9","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/978-3-540-44871-6_69","volume-title":"Pattern Recognition and Image Analysis","author":"F. Moreno-Seco","year":"2003","unstructured":"Moreno-Seco, F., Mic\u00f3, L., Oncina, J.: Extending fast nearest neighbour search algorithms for approximate k-NN classification. In: Perales, F.J., Campilho, A.C., P\u00e9rez, N., Sanfeliu, A. (eds.) IbPRIA 2003. LNCS (LNAI), vol.\u00a02652, pp. 589\u2013597. Springer, Heidelberg (2003)"},{"key":"82_CR10","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"}],"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\/11815921_82","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T10:33:42Z","timestamp":1736505222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11815921_82"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372363","9783540372417"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11815921_82","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}