The extended edit distance metric

Muhammad Marwan Muhammad Fuad, Pierre François Marteau

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

11 Citations (Scopus)

Abstract

The problem of similarity search has attracted increasing attention recently, because it has many applications. Time series are high dimensional data objects. In order to utilize an indexing structure that can effectively handle large time series databases, we need to reduce the dimensionality of these data objects. One of the promising techniques of dimensionality reduction is symbolic representation, which allows researchers to avail from the wealth of text-retrieval algorithms and techniques. To improve the effectiveness of similarity search we propose an extension to the well-known edit distance that we call the extended edit distance. This new distance is applied to symbolic sequential data objects. We test the proposed distance on time series data bases in classification task experiments. We also compare it to other distances that are well known in the literature for symbolic data objects, and we also prove, mathematically, that our new distance is metric

Original languageEnglish
Title of host publication2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings
PublisherIEEE
Pages242-248
Number of pages7
ISBN (Electronic)978-1-4244-2044-5
ISBN (Print)978-1-4244-2043-8
DOIs
Publication statusPublished - 15 Aug 2008
Externally publishedYes
Event2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008 - London, United Kingdom
Duration: 18 Jun 200820 Jun 2008

Publication series

Name2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings

Conference

Conference2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008
CountryUnited Kingdom
CityLondon
Period18/06/0820/06/08

Fingerprint

Time series
Experiments
Data base
Similarity search

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Information Systems
  • Information Systems and Management

Cite this

Fuad, M. M. M., & Marteau, P. F. (2008). The extended edit distance metric. In 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings (pp. 242-248). [4564953] (2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings). IEEE. https://doi.org/10.1109/CBMI.2008.4564953

The extended edit distance metric. / Fuad, Muhammad Marwan Muhammad; Marteau, Pierre François.

2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings. IEEE, 2008. p. 242-248 4564953 (2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Fuad, MMM & Marteau, PF 2008, The extended edit distance metric. in 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings., 4564953, 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings, IEEE, pp. 242-248, 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, London, United Kingdom, 18/06/08. https://doi.org/10.1109/CBMI.2008.4564953
Fuad MMM, Marteau PF. The extended edit distance metric. In 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings. IEEE. 2008. p. 242-248. 4564953. (2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings). https://doi.org/10.1109/CBMI.2008.4564953
Fuad, Muhammad Marwan Muhammad ; Marteau, Pierre François. / The extended edit distance metric. 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings. IEEE, 2008. pp. 242-248 (2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings).
@inproceedings{1fd11eaac49e49d38088c6ab9f95b466,
title = "The extended edit distance metric",
abstract = "The problem of similarity search has attracted increasing attention recently, because it has many applications. Time series are high dimensional data objects. In order to utilize an indexing structure that can effectively handle large time series databases, we need to reduce the dimensionality of these data objects. One of the promising techniques of dimensionality reduction is symbolic representation, which allows researchers to avail from the wealth of text-retrieval algorithms and techniques. To improve the effectiveness of similarity search we propose an extension to the well-known edit distance that we call the extended edit distance. This new distance is applied to symbolic sequential data objects. We test the proposed distance on time series data bases in classification task experiments. We also compare it to other distances that are well known in the literature for symbolic data objects, and we also prove, mathematically, that our new distance is metric",
author = "Fuad, {Muhammad Marwan Muhammad} and Marteau, {Pierre Fran{\cc}ois}",
year = "2008",
month = "8",
day = "15",
doi = "10.1109/CBMI.2008.4564953",
language = "English",
isbn = "978-1-4244-2043-8",
series = "2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings",
publisher = "IEEE",
pages = "242--248",
booktitle = "2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings",

}

TY - GEN

T1 - The extended edit distance metric

AU - Fuad, Muhammad Marwan Muhammad

AU - Marteau, Pierre François

PY - 2008/8/15

Y1 - 2008/8/15

N2 - The problem of similarity search has attracted increasing attention recently, because it has many applications. Time series are high dimensional data objects. In order to utilize an indexing structure that can effectively handle large time series databases, we need to reduce the dimensionality of these data objects. One of the promising techniques of dimensionality reduction is symbolic representation, which allows researchers to avail from the wealth of text-retrieval algorithms and techniques. To improve the effectiveness of similarity search we propose an extension to the well-known edit distance that we call the extended edit distance. This new distance is applied to symbolic sequential data objects. We test the proposed distance on time series data bases in classification task experiments. We also compare it to other distances that are well known in the literature for symbolic data objects, and we also prove, mathematically, that our new distance is metric

AB - The problem of similarity search has attracted increasing attention recently, because it has many applications. Time series are high dimensional data objects. In order to utilize an indexing structure that can effectively handle large time series databases, we need to reduce the dimensionality of these data objects. One of the promising techniques of dimensionality reduction is symbolic representation, which allows researchers to avail from the wealth of text-retrieval algorithms and techniques. To improve the effectiveness of similarity search we propose an extension to the well-known edit distance that we call the extended edit distance. This new distance is applied to symbolic sequential data objects. We test the proposed distance on time series data bases in classification task experiments. We also compare it to other distances that are well known in the literature for symbolic data objects, and we also prove, mathematically, that our new distance is metric

UR - http://www.scopus.com/inward/record.url?scp=51849161942&partnerID=8YFLogxK

U2 - 10.1109/CBMI.2008.4564953

DO - 10.1109/CBMI.2008.4564953

M3 - Conference proceeding

SN - 978-1-4244-2043-8

T3 - 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings

SP - 242

EP - 248

BT - 2008 International Workshop on Content-Based Multimedia Indexing, CBMI 2008, Conference Proceedings

PB - IEEE

ER -