Abstract
In pattern recognition there is a variety of applications where the patterns are classified using edit distance. In this paper we present some results comparing the use of tree and string edit distances in a handwritten character recognition task. Some experiments with different number of classes and of classifiers are done.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Gersho, A., Gray, R.M.: Vector quantization and signal compression. Kluwer Academic Publishers, Dordrecht (1991)
Hastie, T., Tibshirani, R.: Classification by pairwise coupling. Technical report, Stanford University and University of Toronto (1996)
Salton, G., McGill, M.J.: Introduction to Modern Information Retrieval. McGraw Hill, New York (1983)
Vidal, E.: New formulation and improvements of the Nearest-Neighbour approximating and eliminating search algorithm(AESA). Pattern Recognition Letters 15(1), 1–7 (1994)
Micó, L., Oncina, J., Vidal, E.: A new version of the nearest-neighbour approximating and eliminating searh algorithm with linear preprocessing-time and memory requirements. Pattern Recognition Letters 15, 9–17 (1994)
Fukunaga, K., Narendra, P.M.: A branch and bound algorithm for computing k-nearest neighbours. IEEE Transactions on Computers 24(7), 750–753 (1975)
Navarro, G.: String Processing and Information Retrieval Symposium and International Workshop on Groupware, pp. 141–148. IEEE Press, Los Alamitos (1999)
Rico-Juan, J.R., Micó, L.: Comparison of AESA and LAESA search algorithms using string and tree edit distances. Pattern Recognition Letters 24(9), 1427–1436 (2003)
Carrasco, R.C., Forcada, M.L.: A note on the Nagendraprasad-Wang-Gupta thinning algorithm. Pattern Recognition Letters 16, 539–541 (1995)
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM Journal of Computing 18, 1245–1262 (1989)
Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. J. ACM 21, 168–173 (1974)
Vidal, E., Lloret, M.J.: Fast speaker independent DTW recognition of isolated words using a metric-space search algorithm (AESA). Speech Communication 7, 417–422 (1988)
Micó, L., Oncina, J.: Comparison of fast nearest neighbour classifiers for handwritten character recognition. Pattern Recognition Letters 19, 351–356 (1998)
Vidal, E., Casacuberta, F., Rulot, H.: Is the DTW distance really a metric? an algorithm reducing the number of dtw comparisons in isolated words. Speech Communication 4, 333–344 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rico-Juan, J.R., Micó, L. (2003). Some Results about the Use of Tree/String Edit Distances in a~Nearest Neighbour Classification Task. In: Perales, F.J., Campilho, A.J.C., de la Blanca, N.P., Sanfeliu, A. (eds) Pattern Recognition and Image Analysis. IbPRIA 2003. Lecture Notes in Computer Science, vol 2652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44871-6_95
Download citation
DOI: https://doi.org/10.1007/978-3-540-44871-6_95
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40217-6
Online ISBN: 978-3-540-44871-6
eBook Packages: Springer Book Archive