论文信息 - Effective Subsequence Matching in Compressed Time Series

Effective Subsequence Matching in Compressed Time Series

A novel algorithm for querying similar time series was proposed to satisfy the requirement of fitting and indexing time series. The approach first fits time series using two parameters of midline distance and turning points, which is benefit for fast retrieval of similar sequences. After finding similar segmented subsequence by segmented dynamic time warping distance, this method then search this subsequence point by point, by which the subsequence is matched accurately. Experiments show the effectiveness of this technique for fitting and indexing of oil data.

Yi Du | Chuanqun Jiang | Detang Lu | Daolun Li | Wen-an Tan

[1] Eamonn J. Keogh,et al. Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases , 2001, Knowledge and Information Systems.

[2] W. Chu,et al. Fast retrieval of similar subsequences in long sequence databases , 1999, Proceedings 1999 Workshop on Knowledge and Data Engineering Exchange (KDEX'99) (Cat. No.PR00453).

[3] Jaideep Srivastava,et al. Event detection from time series data , 1999, KDD '99.

[4] Eamonn J. Keogh,et al. An Enhanced Representation of Time Series Which Allows Fast and Accurate Classification, Clustering and Relevance Feedback , 1998, KDD.

[5] Wesley W. Chu,et al. Segment-based approach for subsequence searches in sequence databases , 2001, Comput. Syst. Sci. Eng..

[6] Padhraic Smyth,et al. Deformable Markov model templates for time-series pattern matching , 2000, KDD '00.

[7] Christos Faloutsos,et al. Efficient retrieval of similar time sequences under time warping , 1998, Proceedings 14th International Conference on Data Engineering.

[8] Donald J. Berndt,et al. Using Dynamic Time Warping to Find Patterns in Time Series , 1994, KDD Workshop.

[9] Xiao Hui and Hi Yunfa. Data Mining Based on Segmented Time Warping Distance in Time Series Database , 2005 .