|
|
Comprehensive and efficient discovery of time series motifs |
Lian-hua Chi*,1, He-hua Chi2, Yu-cai Feng1, Shu-liang Wang3, Zhong-sheng Cao1 |
1 School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China 2 State Key Laboratory of Software Engineering, Computer School, Wuhan University, Wuhan 430079, China 3 International School of Software, Wuhan University, Wuhan 430079, China |
|
|
Abstract Time series motifs are previously unknown, frequently occurring patterns in time series or approximately repeated subsequences that are very similar to each other. There are two issues in time series motifs discovery, the deficiency of the definition of K-motifs given by Lin et al. (2002) and the large computation time for extracting motifs. In this paper, we propose a relatively comprehensive definition of K-motifs to obtain more valuable motifs. To minimize the computation time as much as possible, we extend the triangular inequality pruning method to avoid unnecessary operations and calculations, and propose an optimized matrix structure to produce the candidate motifs almost immediately. Results of two experiments on three time series datasets show that our motifs discovery algorithm is feasible and efficient.
|
Received: 16 February 2011
Published: 30 November 2011
|
|
Comprehensive and efficient discovery of time series motifs
Time series motifs are previously unknown, frequently occurring patterns in time series or approximately repeated subsequences that are very similar to each other. There are two issues in time series motifs discovery, the deficiency of the definition of K-motifs given by Lin et al. (2002) and the large computation time for extracting motifs. In this paper, we propose a relatively comprehensive definition of K-motifs to obtain more valuable motifs. To minimize the computation time as much as possible, we extend the triangular inequality pruning method to avoid unnecessary operations and calculations, and propose an optimized matrix structure to produce the candidate motifs almost immediately. Results of two experiments on three time series datasets show that our motifs discovery algorithm is feasible and efficient.
关键词:
Time series motifs,
Definition of K-motifs,
Optimized matrix structure,
Fast pruning method
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|