Genetic algorithms-based symbolic aggregate approximation

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

13 Citations (Scopus)

Abstract

Time series data appear in a broad variety of economic, medical, and scientific applications. Because of their high dimensionality, time series data are managed by using representation methods. Symbolic representation has attracted particular attention because of the possibility it offers to benefit from algorithms and techniques of other fields in computer science. The symbolic aggregate approximation method (SAX) is one of the most important symbolic representation techniques of times series data. SAX is based on the assumption of "high Gaussianity" of normalized time series which permits it to use breakpoints obtained from Gaussian lookup tables. The use of these breakpoints is the heart of SAX. In this paper we show that this assumption of Gaussianity oversimplifies the problem and can result in very large errors in time series mining tasks. We present an alternative scheme, based on the genetic algorithms (GASAX), to find the breakpoints. The new scheme does not assume any particular distribution of the data, and it does not require normalizing the data either. We conduct experiments on different datasets and we show that the new scheme clearly outperforms the original scheme.

Original languageEnglish
Title of host publicationData Warehousing and Knowledge Discovery - 14th International Conference, DaWaK 2012, Proceedings
PublisherSpringer
Pages105-116
Number of pages12
ISBN (Print)9783642325830
DOIs
Publication statusPublished - 1 Oct 2012
Externally publishedYes
Event14th International Conference on Data Warehousing and Knowledge Discovery - Vienna, Austria
Duration: 3 Sep 20126 Sep 2012

Publication series

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

Conference

Conference14th International Conference on Data Warehousing and Knowledge Discovery
Abbreviated titleDaWaK 2012
CountryAustria
CityVienna
Period3/09/126/09/12

Keywords

  • Genetic Algorithms
  • Symbolic Aggregate Approximation
  • Time Series Mining

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Genetic algorithms-based symbolic aggregate approximation'. Together they form a unique fingerprint.

  • Cite this

    Muhammad Fuad, M. M. (2012). Genetic algorithms-based symbolic aggregate approximation. In Data Warehousing and Knowledge Discovery - 14th International Conference, DaWaK 2012, Proceedings (pp. 105-116). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7448 LNCS). Springer. https://doi.org/10.1007/978-3-642-32584-7_9