DocumentCode
1844996
Title
FSMBO: Fast Time Series Similarity Matching Based on Bit Operation
Author
Lu, Kaifu ; Lin, Shukuan ; Qiao, Jianzhong ; Yu, Ge ; Liu, Hualei
Author_Institution
Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang
fYear
2008
fDate
18-21 Nov. 2008
Firstpage
1866
Lastpage
1871
Abstract
In many domains, such as meteorology, space physics, geography, multimedia, and economics, there are a lot of time series data. People often use similarity matching to deal with time series data in practical application. DTW (Dynamic Time Warping) can provide the stretch ability along the time axis. Therefore, it becomes one of several popular similarity matching algorithms. But DTW incurs a heavy computation cost. Although several improved methods of DTW have been proposed in some literatures, it still can not meet the actual needs. This paper proposes FSMBO (Fast time series Similarity Matching based on Bit Operation). FSMBO algorithm efficiently prunes a significant number of the matching candidates, which leads to a direct reduction in the matching cost. Experiments reveal that FSMBO is significantly faster than the popular methods.
Keywords
dynamic programming; pattern matching; time series; FSMBO algorithm; bit operation-based fast time series similarity matching algorithm; dynamic programming algorithm; dynamic time warping; pattern matching algorithm; Computational efficiency; Data engineering; Dynamic programming; Educational institutions; Euclidean distance; Geography; Heuristic algorithms; Information science; Meteorology; Physics computing; Similarity matching; bit coding mode; bit operation; dynamic programming algorithm; time series;
fLanguage
English
Publisher
ieee
Conference_Titel
Young Computer Scientists, 2008. ICYCS 2008. The 9th International Conference for
Conference_Location
Hunan
Print_ISBN
978-0-7695-3398-8
Electronic_ISBN
978-0-7695-3398-8
Type
conf
DOI
10.1109/ICYCS.2008.262
Filename
4709258
Link To Document