Similarity search of time series has attracted many researchers recently. In this scope, reducing the dimensionality of data is required to scale up the similarity search. Symbolic representation is a promising technique of dimensionality reduction, since it allows researchers to benefit from the richness of algorithms used for textual databases. To improve the effectiveness of similarity search we propose in this paper an extension to the edit distance that we call the extended edit distance. This new distance is applied to symbolic sequential data objects, and we test it on time series data bases in classification task experiments. We also prove that our distance is a metric. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Fuad, M. M. M., & Marteau, P. F. (2008). Extending the edit distance using frequencies of common characters. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5181 LNCS, pp. 150–157). https://doi.org/10.1007/978-3-540-85654-2_18
Mendeley helps you to discover research relevant for your work.