Title :
Finding time series motifs based on cloud model
Author :
Hehua Chi ; Shuliang Wang
Author_Institution :
State Key Lab. of Software Eng., Wuhan Univ., Wuhan, China
Abstract :
The research of finding time series motifs has received much attention recently. In an earlier work, we proposed a relatively comprehensive definition of K-motifs to mine more frequent patterns from time series datasets. However, that work has not given a method to select a better K-motif when we encounter the situation that there are several candidate K-motifs. This paper addresses the problem by introducing a novel method inspired by the cloud model theory. Our method can represent qualitative concepts from the quantitative point of view based on the three numerical characteristics of the cloud model and select a better K-motif effectively and accurately. Finally, in order to demonstrate the feasibility of our method, we conduct several experiments. The results show that our method is feasible and effective.
Keywords :
data mining; pattern classification; time series; K-motif definition; cloud model theory; numerical characteristics; time series datasets; time series motif finding; Dispersion; Entropy; Generators; Numerical models; Numerical stability; Stability analysis; Time series analysis; Cloud Model; K-motifs; Time Series Motifs;
Conference_Titel :
Granular Computing (GrC), 2013 IEEE International Conference on
Conference_Location :
Beijing
DOI :
10.1109/GrC.2013.6740383