Cluster-based genetic segmentation of time series with DWT

  • Authors:
  • Vincent S. Tseng;Chun-Hao Chen;Pai-Chieh Huang;Tzung-Pei Hong

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan 701, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan 701, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng-Kung University, Tainan 701, Taiwan, ROC;Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung 811, Taiwan, ROC and Department of Computer Science and Engineering, National Sun Yat-sen Un ...

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2009

Quantified Score

Hi-index 0.10

Visualization

Abstract

A time series is composed of lots of data points, each of which represents a value at a certain time. Many phenomena can be represented by time series, such as electrocardiograms in medical science, gene expressions in biology and video data in multimedia. Time series have thus been an important and interesting research field due to their frequent appearance in different applications. This paper proposes a time series segmentation approach by combining the clustering technique, the discrete wavelet transformation and the genetic algorithm to automatically find segments and patterns from a time series. The genetic algorithm is used to find the segmentation points for deriving appropriate patterns. In fitness evaluation, the proposed approach first divides the segments in a chromosome into k groups according to their slopes by using clustering techniques. The Euclidean distance is then used to calculate the distance of each subsequence and evaluate a chromosome. The discrete wavelet transformation is also used to adjust the length of the subsequences for calculating the similarity since their length may be different. The evaluation results are utilized to choose appropriate chromosomes for mating. The offspring then undergo recursive evolution until a good result has been obtained. Experimental results show that the proposed approach can get good results in finding appropriate segmentation patterns in time series.