A segment-wise time warping method for time scaling searching

Information Sciences

Volumn 173, Issue 1-3, 2005, Pages 227-254

  Zhou, Mi ^a   Wong, Man Hon ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Similarity search; Spatial indexing; Time series database; Time warping

Indexed keywords

COMPUTATIONAL COMPLEXITY; DATA MINING; DYNAMIC PROGRAMMING; INFORMATION ANALYSIS; MATHEMATICAL TRANSFORMATIONS; NONBIBLIOGRAPHIC RETRIEVAL SYSTEMS; SET THEORY; TIME SERIES ANALYSIS;

SIMILARITY SEARCH; SPATIAL INDEXING; TIME SERIES DATABASES; TIME WARPING;

PATTERN RECOGNITION;

EID: 18844405954     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2004.07.014     Document Type: Article

References (39)

1. D.J. Berndt, J. Clifford, Using dynamic time warping to find patterns in time series, in: AAAI Workshop on Knowledge Discovery in Databases, 1994, pp. 229-248
2. T. Bozkaya, N. Yazdani, Z.M. Ozsoyoglu, Matching and indexing sequences of different lengths, in: Proceedings of the 1997 ACM CIKM, Sixth International Conference on Information and Knowledge Management, 1997 pp. 128-135
3. K.W. Chu, S.K. Lam, and M.H. Wong An efficient hash-based algorithm for sequence data searching The Computer Journal 41 1998 402 415
4. S. Chu, E. Keogh, D. Hart, M. Pazzani, Iterative deepening dynamic time warping for time series, in: International Conference on Data Mining, SDM, 2002
5. T.R. DeMark The New Science of Technical Analysis 1994 John Wily & Sons Inc. New York
6. C. Faloutsos, M. Ranganathan, Y. Manolopoulos, Fast subsequence matching in time-series databases, in: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, 1994, pp. 419-429
7. D.Q. Goldin, P.C. Kanellakis, On similarity queries for time-series data: constraint specification and implementation, in: 1st Internatioanl Conference on the Principles and Practice of Constraint Programming, 1995, pp. 137-153
8. M.W. Kadous, Learning comprehensible descriptions of multivariate time series, in: Proceedings of the 16th International Conference on Machine Learning, 1999, pp. 454-463
9. E.J. Keogh, K. Chakrabarti, M.J. Pazzani, and S. Mehrotra Dimensionality reduction for fast similarity search in large time series databases Knowledge and Information Systems (KAIS) 3 1 2001 263 286
10. E.J. Keogh, M.J. Pazzani, Derivative dynamic time warping, in: First SIAM International Conference on Data Mining (SDM'2001), 2001
11. E.J. Keogh, Fast similarity search in the presence of longitudinal scaling in time series databases, in: Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining, 1997, pp. 20-24
12. E. Keogh, M. Pazzani, Scaling up dynamic time warping to massive datasets, in: Proceeding of the 3rd European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD'99), 1999, pp. 1-11
13. E. Keogh, Exact indexing of dynamic time warping, in: Proceedings of the VLDB 2002, 2002, pp. 406-417
14. S.-W. Kirn, S. Park, W.W. Chu, An index-based approach for similarity search supporting time warping in large sequence databases, in: Proceedings of the ICDE, 2001, pp. 607-614
15. S.-W. Kim, J. Yoon, S. Park, and T.-H. Kim Shape-based retrieval of similar subsequences in time-series databases Proceedings of the 17th Symposium on Proceedings of the 2002 ACM Symposium on Applied Computing 2002 ACM Press New York 438 445
16. S.W. Kim, S. Park, and W. Chu An index-based approach for similarity search supporting time warping in large sequence databases Proceedings of the 17th International Conference on Data Engineering (ICDE' 01) 2001 IEEE New York 607 614
17. S.K. Lam, and M.H. Wong A fast projection algorithm for sequence data searching Data and Knowledge Engineering 28 1998 321 339 (A preliminary version appeared in The Third International Workshop on Next Generation Information Technologies and Systems, 1997, pp. 172-181)
18. W.E. Leland, M.S. Taqqu, W. Willinger, and D.V. Wilson On the self-similar nature of ethernet traffic IEEE/ACM Transactions on Networking 2 1 1994 1 15
19. B. Mandelbrot The Fractal Geometry of Nature 1982 W.H. Freeman New York
20. B. Mandelbrot Fractals and Scaling In Finance Discontinuity, Concentration, Risk 2000 Springer-Verlag Berlin
21. S. Manganaris Supervised Classification with Temporal Data December 1997
22. S. Park, W.W. Chu, J. Yoon, C. Hsu, Efficient searches for similar subsequences of different lengths in sequence databases, in: Proceedings of the ICDE, 2000, pp. 23-32
23. S. Park, S.-W. Kim, J.-S. Cho, S. Padmanabhan, Prefix-querying: an approach for effective subsequence matching under time warping in sequence databases, in: Proceedings of the Tenth International Conference on Information and Knowledge Management, ACM Press, New York, 2001, pp. 255-262
24. S. Park, D. Lee, W. Chu, Fast retrieval of similar subsequences in long sequence databases, Technical Report UCLA-CS-TR990028, University of California, Los Angeles, 1999
25. C.S. Perng, H. Wang, S.R. Zhang, D.S. Parker, Landmarks: a new model for similarity-based pattern querying in time series databases, in: Proceedings of the 16th International Conference on Data Engineering, IEEE Computer Society, Silver Spring, MD, 2000, pp. 33-42
26. W.P.M. Polly, M.H. Wong, Efficient and robust feature extraction and pattern matching of time series by a lattice structure, in: Proceedings of the 2001 ACM CIKM International Conference on Information and Knowledge Management, ACM, New York, 2001, pp. 271-278
27. M.J. Pring Technical Analysis Explained 1991 McGraw-Hill New York
28. L. Rabiner, and B.-H. Juang Fundamentals of Speech Recognition 1993 Prentice-Hall Englewood Cliffs, NJ
29. D. Rafiei, A. Mendelzon, Similarity-based queries for time series data, in: Proceedings of the 1997 ACM SIGMOD International Conference on Management of Data, 1997, pp. 13-25
30. J.J. Rodriguez, C.J. Alonso, Applying boosting to similarity literals for time series classification, in: Multiple Classifier Systems, First International Workshop, 2000, pp. 210-219
31. N. Saito, Local feature extraction and its application using a library of bases, Ph.D. Thesis, Yale University, December 1994
32. H. Sakoe, and S. Chiba Dynamic programming algorithm optimization for spoken word recognition IEEE Transactions of Acoustics Speech and Signal Processing, ASSP 26 1 1978 43 49
33. D. Sankoff, and J.B. Kruskal Time Wraps, String Matching, Macro-molecules: The Theory and Practice of Sequence Comparison 1983 Addison-Wesley Reading, MA
34. H. Shatkay, S.B. Zdonik, Approximate queries and representations for large data sequences. In: Proceedings of the 12th International Conference on Data Engineering, 1996, pp. 536-545
35. D. Sornette Critical Phenomena in Natural Sciences 2000 Springer-Verlag Berlin
36. S. Theodoridis, K. Koutroumbas, and R. Smith Pattern Recognition 1999 Academic Press New York
37. S.F. Wong, M.H. Wong, Efficient subsequence matching for sequences databases under time warping, in: Proceedings of the 7th International Database Engineering and Applications Symposium (IDEAS'03), 2003, pp. 139-148
38. B.-K. Yi, and C. Faloutsos Fast time sequence indexing for arbitrary Ip norms VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases 2000 Morgan Kaufmann Los Altos, CA 385 394
39. B. Yi, H.V. Jagadish, C. Faloutsos, Efficient retrieval of similar time sequences under time warping, in: Proceedings of the 14th International Conference on Data Engineering, 1998, pp. 201-208