Extending the edit distance using frequencies of common characters

Muhammad Marwan Muhammad Fuad, Pierre François Marteau

Research output: Chapter in Book/Report/Conference proceedingConference proceedingpeer-review

4 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationDatabase and Expert Systems Applications - 19th International Conference, DEXA 2008, Proceedings
EditorsSourav S Bhowmick, Josef Kung, Roland Wagner
Number of pages8
ISBN (Electronic)978-3-540-85654-2
ISBN (Print)978-3-540-85653-5
Publication statusPublished - 7 Oct 2008
Event19th International Conference on Database and Expert Systems Applications, DEXA 2008 - Turin, Italy
Duration: 1 Sep 20085 Sep 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5181 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference19th International Conference on Database and Expert Systems Applications, DEXA 2008


  • Symbolic Representation
  • The Edit Distance
  • Time Series

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Extending the edit distance using frequencies of common characters'. Together they form a unique fingerprint.

Cite this