A common way of expressing string similarity in structural pattern recognition is the edit distance. It allows one to apply the kNN rule in order to classify a set of strings. However, compared to the wide range of elaborated classifiers known from statistical pattern recognition, this is only a very basic method. In the present paper we propose a method for transforming strings into n-dimensional real vector spaces based on prototype selection. This allows us to subsequently classify the transformed strings with more sophisticated classifiers, such as support vector machine and other kernel based methods. In a number of experiments, we show that the recognition rate can be significantly improved by means of this procedure. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Spillmann, B., Neuhaus, M., Bunke, H., Pȩkalska, E., & Duin, R. P. W. (2006). Transforming strings to vector spaces using prototype selection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4109 LNCS, pp. 287–296). Springer Verlag. https://doi.org/10.1007/11815921_31
Mendeley helps you to discover research relevant for your work.