The move-split-merge metric for time series

IEEE Transactions on Knowledge and Data Engineering

Volumn 25, Issue 6, 2013, Pages 1425-1438

  Stefan, Alexandra ^a   Athitsos, Vassilis ^a   Das, Gautam ^b  

^a University of Texas at Arlington   (United States)

^b QATAR COMPUTING RESEARCH INSTITUTE   (Qatar)

Author keywords

Distance metrics; Similarity measures; Similarity search; Time series

Indexed keywords

ASSOCIATED COSTS; BUILDING BLOCKES; DISTANCE METRICS; DYNAMIC TIME WARPING; FUNDAMENTAL OPERATIONS; NEAREST NEIGHBOR CLASSIFICATION; SIMILARITY MEASURE; SIMILARITY SEARCH;

CLASSIFICATION (OF INFORMATION); MERGERS AND ACQUISITIONS;

TIME SERIES;

EID: 84897584209     PISSN: 10414347     EISSN: None     Source Type: Journal    
DOI: 10.1109/TKDE.2012.88     Document Type: Article

References (26)

1. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos, "Fast Subsequence Matching in Time-Series Databases," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 419-429, 1994.
2. K.-P. Chan and A.W.-C. Fu, "Efficient Time Series Matching by Wavelets," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 126-133, 1999.
3. Y. Moon, K. Whang, and W. Han, "General Match: A Subsequence Matching Method in Time-Series Databases Based on Generalized Windows," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 382-393, 2002. (Pubitemid 34985563)
4. Y. Moon, K. Whang, and W. Loh, "Duality-Based Subsequence Matching in Time-Series Databases," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 263-272, 2001. (Pubitemid 32457127)
5. T. Argyros and C. Ermopoulos, "Efficient Subsequence Matching in Time Series Databases under Time and Amplitude Transformations," Proc. Int'l Conf. Data Mining, pp. 481-484, 2003.
6. D. Rafiei and A.O. Mendelzon, "Similarity-Based Queries for Time Series Data," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 13-25, 1997.
7. H. Wu, B. Salzberg, G.C. Sharp, S.B. Jiang, H. Shirato, and D.R. Kaeli, "Subsequence Matching on Structured Time Series Data," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 682-693, 2005. (Pubitemid 43038967)
8. J.B. Kruskal and M. Liberman, "The Symmetric Time Warping Algorithm: From Continuous to Discrete," Time Warps. Addison-Wesley, 1983.
9. E. Keogh, "Exact Indexing of Dynamic Time Warping," Proc. Int'l Conf. Very Large Databases (VLDB), pp. 406-417, 2002.
10. M. Vlachos, D. Gunopulos, and G. Kollios, "Discovering Similar Multidimensional Trajectories," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 673-684, 2002. (Pubitemid 34278779)
11. L. Latecki, V. Megalooikonomou, Q. Wang, R. Lakamper, C. Ratanamahatana, and E. Keogh, "Elastic Partial Matching of Time Series," Proc. European Conf. Principles of Data Mining and Knowledge Discovery (PKDD), pp. 577-584, 2005.
12. L. Chen, M.T. O ? zsu, and V. Oria, "Robust and Fast Similarity Search for Moving Object Trajectories," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 491-502, 2005. (Pubitemid 43038952)
13. L. Chen and R.T. Ng, "On the Marriage of Lp-Norms and Edit Distance," Proc. Int'l Conf. Very Large Databases (VLDB), pp. 792-803, 2004.
14. V.I. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals," Soviet Physics, vol. 10, no. 8, pp. 707-710, 1966.
15. E. Keogh, "The UCR Time Series Data Mining Archive. http://www.cs.ucr.edu/eamonn/tsdma/index.html," http://www.cs. ucr.edu/eamonn/TSDMA/index.html, 2006.
16. G.R. Hjaltason and H. Samet, "Index-Driven Similarity Search in Metric Spaces," ACM Trans. Database Systems (TODS), vol. 28, no. 4, pp. 517-580, 2003.
17. P. Yianilos, "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces," Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 311-321, 1993. (Pubitemid 23612715)
18. G. Hjaltason and H. Samet, "Properties of Embedding Methods for Similarity Searching in Metric Spaces," IEEE Trans. Pattern Analysis and Machine Intelligence (PAMI), vol. 25, no. 5, pp. 530-549, May 2003.
19. M. Morse and J. Patel, "An Efficient and Accurate Method for Evaluating Time Series Similarity," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 569-580, 2007. (Pubitemid 47630835)
20. Y. Sakurai, M. Yoshikawa, and C. Faloutsos, "FTW: Fast Similarity Search under the Time Warping Distance," Proc. Principles of Database Systems (PODS), pp. 326-337, 2005. (Pubitemid 43275495)
21. N. Brisaboa, O. Pedreira, D. Seco, R. Solar, and R. Uribe, "Clustering-Based Similarity Search in Metric Spaces with Sparse Spatial Centers," Proc. 34th Int'l Conf. Current Trends in Theory and Practice of Computer Science, vol. 4910, pp. 186-197, 2008. (Pubitemid 351154014)
22. V. Ganti, R. Ramakrishnan, J. Gehrke, A.L. Powell, and J.C. French, "Clustering Large Data Sets in Arbitrary Metric Spaces," Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp. 502-511, 1999.
23. P. Indyk, "A Sublinear Time Approximation Scheme for Clustering in Metric Spaces," Proc. Ann. Symp. Foundations of Computer Science (FOCS), pp. 154-159, 1999. (Pubitemid 30539985)
24. I. Borg and P. Groenen, Modern Multidimensional Scaling: Theory and Applications. Springer, 2005.
25. C.M. Bishop, M. Svensén, and C.K.I. Williams, "GTM: The Generative Topographic Mapping," Neural Computation, vol. 10, no. 1, pp. 215-234, 1998. (Pubitemid 128463659)
26. C. Faloutsos and K.I. Lin, "FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Data Sets," Proc. ACM Int'l Conf. Management of Data (SIGMOD), pp. 163-174, 1995.