论文信息 - Longest Common Subsequence Based Algorithm for Measuring Similarity Between Time Series: A New Approach

Longest Common Subsequence Based Algorithm for Measuring Similarity Between Time Series: A New Approach

In this paper, a robust algorithm is presented for finding similarity between two time series. The longest common subsequence (LCSS) is calculated by avoiding unnecessary comparisons. A time control parameter is introduced to prevent it from matching the 1 element of a time series with the last element of st

[1] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.

[2] Thomas G. Szymanski,et al. A fast algorithm for computing longest common subsequences , 1977, CACM.

[3] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.

[4] Claus Rick,et al. A New Flexible Algorithm for the Longest Common Subsequence Problem , 1995, Nord. J. Comput..

[5] Hui Wang,et al. All Common Subsequences , 2007, IJCAI.

[6] Afroza Begum,et al. A GREEDY APPROACH FOR COMPUTING LONGEST COMMON SUBSEQUENCES , 2008 .

[7] Hui Ding,et al. Querying and mining of time series data: experimental comparison of representations and distance measures , 2008, Proc. VLDB Endow..