Effective Subsequence Matching in Compressed Time Series

Author

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

Author_Institution

Sch. of Comput., Shanghai Second Polytech. Univ., Shanghai

Volume

2

fYear

2008

fDate

6-8 Oct. 2008

Firstpage

922

Lastpage

926

Abstract

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.

Keywords

data compression; indexing; query processing; time series; compressed time series; data fitting; data indexing; midline distance; segmented dynamic time warping distance; sequence retrieval; similarity query; subsequence matching; turning points; Data visualization; Databases; Distortion measurement; Euclidean distance; Indexing; Information retrieval; Length measurement; Petroleum; Scalability; Turning; Dynamic Time Warping; Linear Compression; Oil Data; Similarity Matching; Time Series;

fLanguage

English

Publisher

ieee

Conference_Titel

Pervasive Computing and Applications, 2008. ICPCA 2008. Third International Conference on

Conference_Location

Alexandria

Print_ISBN

978-1-4244-2020-9

Electronic_ISBN

978-1-4244-2021-6

Type

conf

DOI

10.1109/ICPCA.2008.4783742

Filename

4783742