FSMBO: Fast Time Series Similarity Matching Based on Bit Operation
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.
Similarity matching time series dynamic programming algorithm bit coding mode bit operation.
Kaifu Lu Shukuan Lin Jianzhong Qiao Ge Yu Hualei Liu
College of Information Science and Engineering, Northeastern University, Shenyang 110004, Liaoning, China
国际会议
The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)
安徽黄山
英文
1866-1871
2008-11-18(万方平台首次上网日期,不代表论文的发表时间)