Using differential evolution to set weights to segments with different information content in the piecewise aggregate approximation

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

Abstract

Time series mining handles several tasks such as classification, clustering and similarity search. These data are high-dimensional in nature so time series representation methods are widely used to reduce the dimensionality of these data so that they can be handled efficiently and effectively. One of the side effects of using representation methods is the loss of information which results from the dimensionality reduction implied in the representation methods. Several representation methods have pointed out that some regions in the times series may contain more information than others so a faithful representation method should be able to reflect the different information contents in different regions of a time series. One of the techniques that can be utilized for this purpose is to set different weights to different regions according to the information they contain, but the challenge is to find an objective scheme to set the weights. Differential evolution is an efficient optimizer that has been successfully used to solve many optimization problems, mainly continuous ones. In this paper we show how differential evolution can be used to set weights to different segments of time series according to their information content. Although our scheme establishes a fully functional time series representation method, with lower bounding distance and a dimensionality reduction technique, we consider this as a by-product of our work and our main aim is to show how the information contents of different time series segments can be reflected using unconventional methods such as the differential evolution. We compare the new scheme with the piecewise aggregate approximation as a method that completely lacks the ability to distinguish regions with high information from others with low information. We show how the new scheme can recover the loss of information caused by dimensionality reduction. We validate our scheme by experiments on different datasets.

Original languageEnglish
Title of host publicationAdvances in Knowledge-Based and Intelligent Information and Engineering Systems
EditorsManuel Graña, Carlos Toro, Jorge Posada, Robert J. Howlett, Lakhmi C. Jain
PublisherIOS Press
Pages440-449
Number of pages10
ISBN (Print)9781614991045
DOIs
Publication statusPublished - Sep 2012
Externally publishedYes

Publication series

NameFrontiers in Artificial Intelligence and Applications
Volume243
ISSN (Print)0922-6389

Keywords

  • Differential Evolution
  • Information Content
  • Information Loss
  • Time Series Data Mining
  • Weighted Euclidean Distance

ASJC Scopus subject areas

  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Using differential evolution to set weights to segments with different information content in the piecewise aggregate approximation'. Together they form a unique fingerprint.

  • Cite this

    Fuad, M. M. M. (2012). Using differential evolution to set weights to segments with different information content in the piecewise aggregate approximation. In M. Graña, C. Toro, J. Posada, R. J. Howlett, & L. C. Jain (Eds.), Advances in Knowledge-Based and Intelligent Information and Engineering Systems (pp. 440-449). (Frontiers in Artificial Intelligence and Applications; Vol. 243). IOS Press. https://doi.org/10.3233/978-1-61499-105-2-440