Enhancing the symbolic aggregate approximation method using updated lookup tables

Muhammad Marwan Muhammad Fuad, Pierre François Marteau

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

5 Citations (Scopus)

Abstract

Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. There are many representation techniques that aim at reducing the dimensionality of time series so that the search can be handled faster at a lower dimensional space level. Symbolic representation is one of the promising techniques, since symbolic representation methods try to benefit from the wealth of search algorithms used in bioinformatics and text mining communities. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. SAX utilizes a similarity measure that is easy to compute because it is based on pre-computed distances obtained from lookup tables. In this paper we present a new similarity measure that is almost as easy to compute as the original similarity measure, but it is tighter because it uses updated lookup tables. In addition, the new similarity measure is more intuitive than the original one. We conduct several experiments which show that the new similarity measure gives better results than the original one.

Original languageEnglish
Title of host publicationKnowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings
PublisherSpringer
Pages420-431
Number of pages12
EditionPART 1
ISBN (Electronic)978-3-642-15387-7
ISBN (Print)978-3-642-15386-0
DOIs
Publication statusPublished - 23 Nov 2010
Event14th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2010 - Cardiff, United Kingdom
Duration: 8 Sep 201010 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 1
Volume6276 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2010
CountryUnited Kingdom
CityCardiff
Period8/09/1010/09/10

Fingerprint

Table lookup
Look-up Table
Similarity Measure
Approximation Methods
Time series
Dimensionality
Bioinformatics
Data mining
Similarity Search
Text Mining
Scanning
Approximation
Time Series Data
Search Algorithm
Intuitive
Data Mining
Experiments
Experiment

Keywords

  • Symbolic Aggregate Approximation
  • Symbolic Representation
  • Time Series Data Mining
  • Updated Minimum Distance

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Muhammad Fuad, M. M., & Marteau, P. F. (2010). Enhancing the symbolic aggregate approximation method using updated lookup tables. In Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings (PART 1 ed., pp. 420-431). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6276 LNAI, No. PART 1). Springer. https://doi.org/10.1007/978-3-642-15387-7_46

Enhancing the symbolic aggregate approximation method using updated lookup tables. / Muhammad Fuad, Muhammad Marwan; Marteau, Pierre François.

Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings. PART 1. ed. Springer, 2010. p. 420-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6276 LNAI, No. PART 1).

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

Muhammad Fuad, MM & Marteau, PF 2010, Enhancing the symbolic aggregate approximation method using updated lookup tables. in Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 6276 LNAI, Springer, pp. 420-431, 14th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2010, Cardiff, United Kingdom, 8/09/10. https://doi.org/10.1007/978-3-642-15387-7_46
Muhammad Fuad MM, Marteau PF. Enhancing the symbolic aggregate approximation method using updated lookup tables. In Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings. PART 1 ed. Springer. 2010. p. 420-431. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). https://doi.org/10.1007/978-3-642-15387-7_46
Muhammad Fuad, Muhammad Marwan ; Marteau, Pierre François. / Enhancing the symbolic aggregate approximation method using updated lookup tables. Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings. PART 1. ed. Springer, 2010. pp. 420-431 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1).
@inproceedings{5d740b02131c42818bce69c4f58c493d,
title = "Enhancing the symbolic aggregate approximation method using updated lookup tables",
abstract = "Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. There are many representation techniques that aim at reducing the dimensionality of time series so that the search can be handled faster at a lower dimensional space level. Symbolic representation is one of the promising techniques, since symbolic representation methods try to benefit from the wealth of search algorithms used in bioinformatics and text mining communities. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. SAX utilizes a similarity measure that is easy to compute because it is based on pre-computed distances obtained from lookup tables. In this paper we present a new similarity measure that is almost as easy to compute as the original similarity measure, but it is tighter because it uses updated lookup tables. In addition, the new similarity measure is more intuitive than the original one. We conduct several experiments which show that the new similarity measure gives better results than the original one.",
keywords = "Symbolic Aggregate Approximation, Symbolic Representation, Time Series Data Mining, Updated Minimum Distance",
author = "{Muhammad Fuad}, {Muhammad Marwan} and Marteau, {Pierre Fran{\cc}ois}",
year = "2010",
month = "11",
day = "23",
doi = "10.1007/978-3-642-15387-7_46",
language = "English",
isbn = "978-3-642-15386-0",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer",
number = "PART 1",
pages = "420--431",
booktitle = "Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings",
edition = "PART 1",

}

TY - GEN

T1 - Enhancing the symbolic aggregate approximation method using updated lookup tables

AU - Muhammad Fuad, Muhammad Marwan

AU - Marteau, Pierre François

PY - 2010/11/23

Y1 - 2010/11/23

N2 - Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. There are many representation techniques that aim at reducing the dimensionality of time series so that the search can be handled faster at a lower dimensional space level. Symbolic representation is one of the promising techniques, since symbolic representation methods try to benefit from the wealth of search algorithms used in bioinformatics and text mining communities. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. SAX utilizes a similarity measure that is easy to compute because it is based on pre-computed distances obtained from lookup tables. In this paper we present a new similarity measure that is almost as easy to compute as the original similarity measure, but it is tighter because it uses updated lookup tables. In addition, the new similarity measure is more intuitive than the original one. We conduct several experiments which show that the new similarity measure gives better results than the original one.

AB - Similarity search in time series data mining is a problem that has attracted increasing attention recently. The high dimensionality and large volume of time series databases make sequential scanning inefficient to tackle this problem. There are many representation techniques that aim at reducing the dimensionality of time series so that the search can be handled faster at a lower dimensional space level. Symbolic representation is one of the promising techniques, since symbolic representation methods try to benefit from the wealth of search algorithms used in bioinformatics and text mining communities. The symbolic aggregate approximation (SAX) is one of the most competitive methods in the literature. SAX utilizes a similarity measure that is easy to compute because it is based on pre-computed distances obtained from lookup tables. In this paper we present a new similarity measure that is almost as easy to compute as the original similarity measure, but it is tighter because it uses updated lookup tables. In addition, the new similarity measure is more intuitive than the original one. We conduct several experiments which show that the new similarity measure gives better results than the original one.

KW - Symbolic Aggregate Approximation

KW - Symbolic Representation

KW - Time Series Data Mining

KW - Updated Minimum Distance

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

U2 - 10.1007/978-3-642-15387-7_46

DO - 10.1007/978-3-642-15387-7_46

M3 - Conference proceeding

SN - 978-3-642-15386-0

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 420

EP - 431

BT - Knowledge-Based and Intelligent Information and Engineering Systems - 14th International Conference, KES 2010, Proceedings

PB - Springer

ER -