Paper Title:
Research on Exact Lower Bounding Segmentation of DTW Distance
  Abstract

Dynamic time warping(DTW) distance is the most effective similarity measurement methods in time-series data mining area. Because of the high computational complexity of DTW, it is not suitable for huge amounts of data. Thus, some DTW distance lower bound methods are proposed, which can improve the efficiency of DTW distance calculation. In this paper, we summarized the existing lower bound of DTW method and then proposed a closely related field with the application and exacted Lower Bounding distance measure with Segmentation(eLBS). Experiment results show that this method meet the need of non-omission.

  Info
Periodical
Advanced Materials Research (Volumes 255-260)
Edited by
Jingying Zhao
Pages
2267-2271
DOI
10.4028/www.scientific.net/AMR.255-260.2267
Citation
L. Feng, C. Y. Xu, H. Zheng, B. Jin, "Research on Exact Lower Bounding Segmentation of DTW Distance", Advanced Materials Research, Vols. 255-260, pp. 2267-2271, 2011
Online since
May 2011
Export
Price
$32.00
Share

In order to see related information, you need to Login.

In order to see related information, you need to Login.

Authors: Lu Na Byon, Jeong Hye Han
Abstract:As electronic commerce progresses, temporal association rules are developed by time to offer personalized services for customer’s interests....
287
Authors: Zhi Qiang Xie, Jing Yang, Yu Jing He, Guang Jie Ye
Abstract:Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an...
897
Authors: Zhong Ping Zhang, Yong Xin Liang
Abstract:This paper proposes a new data stream outlier detection algorithm SODRNN based on reverse nearest neighbors. We deal with the sliding window...
1032
Authors: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen
Chapter 16: Geographic Information and Remote Sensing Science
Abstract:FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of...
2880
Authors: Hai Feng Li, Ning Zhang
Chapter 1: Transportation & Service Science
Abstract:Maximal frequent itemsets are one of several condensed representations of frequent itemsets, which store most of the information contained in...
21