Transforming strings to vector spaces using prototype selection

  • Authors:
  • Barbara Spillmann;Michel Neuhaus;Horst Bunke;Elżbieta Pękalska;Robert P. W. Duin

  • Affiliations:
  • Institute of Computer Science and Applied Mathematics, University of Bern, Bern, Switzerland;Institute of Computer Science and Applied Mathematics, University of Bern, Bern, Switzerland;Institute of Computer Science and Applied Mathematics, University of Bern, Bern, Switzerland;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, CD, The Netherlands;Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Delft, CD, The Netherlands

  • Venue:
  • SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.