{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:11Z","timestamp":1725563531374},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642149795"},{"type":"electronic","value":"9783642149801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14980-1_74","type":"book-chapter","created":{"date-parts":[[2010,8,28]],"date-time":"2010-08-28T10:05:23Z","timestamp":1282989923000},"page":"748-756","source":"Crossref","is-referenced-by-count":1,"title":["A New Editing Scheme Based on a Fast Two-String Median Computation Applied to OCR"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Ignacio","family":"Abreu Salas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan Ram\u00f3n","family":"Rico-Juan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"74_CR1","doi-asserted-by":"crossref","unstructured":"C\u00e1rdenas, R.: A Learning Model for Multiple-Prototype Classification of Strings. In: 17th International Conference on Pattern Recognition, vol.\u00a04, pp. 420\u2013442 (2004)","DOI":"10.1109\/ICPR.2004.1333792"},{"key":"74_CR2","unstructured":"Devijver, I., Kittler, J.: On the edited nearest neighbour rule. In: 5th Int. Conf. on Pattern Recognition, pp. 72\u201380 (1980)"},{"key":"74_CR3","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/34.922703","volume":"23","author":"N. Duta","year":"2001","unstructured":"Duta, N., Jain, A., Dubuisson-Jolly, M.: Automatic Construction of 2D Shape Models. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023, 433\u2013446 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"74_CR4","doi-asserted-by":"crossref","unstructured":"Ferri, F., Vidal, E.: Comparison of several editing and condensing techniques for colour image segmentation and object location. Pattern Recognition and Image Analysis (1992)","DOI":"10.1142\/9789812797902_0009"},{"key":"74_CR5","unstructured":"Jiang, X., Schiffmann, L., Bunke, H.: Computation of median shapes. In: 4th Asian Conference on Computer Vision (2000)"},{"key":"74_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0031-3203(81)90102-3","volume":"13","author":"J. Koplowitz","year":"1981","unstructured":"Koplowitz, J., Brown, T.: On the relation of performance to editing in nearest neighbour rules. Pattern Recognition\u00a013, 251\u2013255 (1981)","journal-title":"Pattern Recognition"},{"key":"74_CR7","first-page":"707","volume":"10","author":"V. Levenshtein","year":"1966","unstructured":"Levenshtein, V.: Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics\u00a010, 707\u2013710 (1966)","journal-title":"Soviet Physics"},{"key":"74_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0167-8655(02)00209-X","volume":"24","author":"C. Mart\u00ednez","year":"2003","unstructured":"Mart\u00ednez, C., Juan, A., Casacubierta, F.: Median strings for k-nearest neighbour classification*1. Pattern Recognition Letters\u00a024, 173\u2013181 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"74_CR9","doi-asserted-by":"crossref","unstructured":"Olvera, J., Mart\u00ednez, F.: Edition schemes based on BSE. In: 10th Iberoamerican Congress on Pattern Recognition, pp. 360\u2013368 (2005)","DOI":"10.1007\/11578079_38"},{"key":"74_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TSMC.1977.4309660","volume":"7","author":"C. Penrod","year":"1977","unstructured":"Penrod, C., Wagner, T.: Another look at the edited neares neighbour rule. IEEE Trans. on Systems, Man and Cybernetics\u00a07, 92\u201394 (1977)","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"74_CR11","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1016\/S0167-8655(02)00382-3","volume":"24","author":"J.R. Rico-Juan","year":"2003","unstructured":"Rico-Juan, J.R., Mic\u00f3, L.: Comparison of AESA and LAESA search algorithms using string and tree-edit-distances. Pattern Recognition Letters\u00a024, 1417\u20131426 (2003)","journal-title":"Pattern Recognition Letters"},{"key":"74_CR12","unstructured":"S\u00e1nchez, J., Pla, F., Ferri, F.: Using the nearest centroid neighbourhood concept for editing purposes. In: 7th Symposium National de Reconocimiento de Formas y An\u00e1lisis de Im\u00e1gen, vol.\u00a01, pp. 175\u2013180 (1997)"},{"key":"74_CR13","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1109\/TSMC.1976.4309523","volume":"6","author":"I. Tomek","year":"1976","unstructured":"Tomek, I.: An experiment with the edit nearest neighbour. IEEE Trans. on Systems, Man and Cybernetics\u00a06, 448\u2013452 (1976)","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"74_CR14","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1109\/TSMC.1976.5409182","volume":"6","author":"I. Tomek","year":"1976","unstructured":"Tomek, I.: A generalization of the k-NN rule. IEEE Trans. on Systems, Man and Cybernetics\u00a06, 121\u2013126 (1976)","journal-title":"IEEE Trans. on Systems, Man and Cybernetics"},{"key":"74_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/11492542_5","volume-title":"Pattern Recognition and Image Analysis","author":"F. V\u00e1zquez","year":"2005","unstructured":"V\u00e1zquez, F., S\u00e1nchez, J., Pla, F.: A stochastic approach to Wilson\u2019s editing algorithm. In: Marques, J.S., P\u00e9rez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol.\u00a03523, pp. 35\u201342. Springer, Heidelberg (2005)"},{"key":"74_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. Wagner","year":"1974","unstructured":"Wagner, R., Fischer, M.: The String-to-String Correction Problem. Journal of the ACM\u00a021, 168\u2013173 (1974)","journal-title":"Journal of the ACM"},{"key":"74_CR17","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1109\/TSMC.1972.4309137","volume":"2","author":"D. Wilson","year":"1972","unstructured":"Wilson, D.: Asymptotic properties of nearest neighbor rules using edited data. IEEE Trans. on Systems, Man. and Cybernetics\u00a02, 408\u2013421 (1972)","journal-title":"IEEE Trans. on Systems, Man. and Cybernetics"},{"key":"74_CR18","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1023\/A:1007626913721","volume":"38","author":"D. Wilson","year":"2000","unstructured":"Wilson, D., Mart\u00ednez, T.: Reduction techniques for instance based learning algorithms. Machine Learning\u00a038, 257\u2013286 (2000)","journal-title":"Machine Learning"}],"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\/978-3-642-14980-1_74.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:00:16Z","timestamp":1606186816000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14980-1_74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642149795","9783642149801"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14980-1_74","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}