Time Series Symbolization and Search for Frequent Patterns - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Time Series Symbolization and Search for Frequent Patterns

van Hoan Mai
  • Function : Author
  • PersonId : 949547

Abstract

In this paper, we focus on two aspects of time series mining: first on the transformation of numerical data to symbolic data; then on the search for frequent patterns in the resulting symbolic time series. We are thus interested in some patterns which have a high frequency in our database of time series and might help to generate candidates for various tasks in the area of time series mining. During the symbolization phase, we transform the numerical time series into a symbolic time series by i) splitting this latter into consecutive subsequences, ii) using a clustering algorithm to cluster these subsequences, each subsequence being then replaced by the name of its cluster to produce the symbolic time series. In the second phase, we use a sliding window to create a collection of transactions from the symbolic time series, then we use some algorithm for mining sequential pattern to find out some interesting motifs in the original time series. An example experiment based on environmental data is presented.
No file

Dates and versions

hal-00916092 , version 1 (09-12-2013)

Identifiers

  • HAL Id : hal-00916092 , version 1

Cite

Matthieu Exbrayat, van Hoan Mai. Time Series Symbolization and Search for Frequent Patterns. 4th International Symposium on Information and Communication Technology - SoICT 2013, Dec 2013, Da Nang, Vietnam. pp.ISBN:978-1-4503-2454-0. ⟨hal-00916092⟩
74 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More