Approximate embedding-based subsequence matching of time series

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2008, Pages 365-378

  Athitsos, Vassilis ^a   Papapetrou, Panagiotis ^b   Potamias, Michalis ^b   Kollios, George ^b   Gunopulos, Dimitrios ^c  

^a The University of Texas at Arlington   (United States)

^b BOSTON UNIVERSITY   (United States)

^c UNIVERSITY OF ATHENS   (Greece)

Author keywords

Algorithms

Indexed keywords

AREAS OF INTERESTS; DATABASE SEQUENCES; DISTANCE MEASURES; DYNAMIC TIME WARPING; QUERY OBJECTS; REFERENCE OBJECTS; RETRIEVAL ACCURACIES; SMALL LOSSES; SPEED-UP; SUBSEQUENCE MATCHING; SUBSEQUENCE MATCHING ALGORITHMS; TIME SERIES; TIME-SERIES DATUM;

INDEXING (OF INFORMATION); VECTORS; WEAVING;

DATABASE SYSTEMS;

EID: 57149141135     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376616.1376656     Document Type: Conference Paper

References (44)

1. J. Alon, V. Athitsos, and S. Sclaroff. Accurate and efficient gesture spotting via pruning and subgesture reasoning. In IEEE Workshop on Human Computer Interaction, pages 189-198, 2005.
2. T. Argyros and C. Ermopoulos. Efficient subsequence matching in time series databases under time and amplitude transformations. In International Conference on Data Mining, pages 481-484, 2003.
3. V. Athitsos, M. Hadjieleftheriou, G. Kollios, and S. Sclaroff. Query-sensitive embeddings. In ACM International Conference on Management of Data (SIGMOD), pages 706-717, 2005.
4. C. Böhm, S. Berchtold, and D. A. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, 33(3):322-373, 2001.
5. K. Chakrabarti and S. Mehrotra. Local dimensionality reduction: A new approach to indexing high dimensional spaces. In International Conference on Very Large Data Bases, pages 89-100, 2000.
6. Ö. Egecioglu and H. Ferhatosmanoglu. Dimensionality reduction and similarity distance computation by inner product approximations. In International Conference on Information and Knowledge Management, pages 219-226, 2000.
7. C. Faloutsos and K. I. Lin. FastMap: A fast algorithm for indexing, data-mining and visualization of traditional and multimedia datasets. In ACM International Conference on Management of Data (SIGMOD), pages 163-174, 1995.
8. C. Faloutsos, M. Ranganathan, and Y. Manolopoulos. Fast subsequence matching in time-series databases. In ACM International Conference on Management of Data (SIGMOD), pages 419-429, 1994.
9. A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In International Conference on Very Large Databases, pages 518-529, 1999.
10. D. Q. Goldin and P. C. Kanellakis. On similarity queries for time-series data: Constraint specification and implementation. In International Conference on Principles and Practice of Constraint Programming, pages 137-153, 1995.
11. W.-S. Han, J. Lee, Y.-S. Moon, and H. Jiang. Ranked subsequence matching in time-series databases. In International Conference on Very Large Data Bases (VLDB), pages 423-434, 2007.
12. G. Hjaltason and H. Samet. Properties of embedding methods for similarity searching in metric spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(5):530-549, 2003.
13. G. R. Hjaltason and H. Samet. Index-driven similarity search in metric spaces. ACM Transactions on Database Systems, 28(4):517-580, 2003.
14. G. Hristescu and M. Farach-Colton. Cluster-preserving embedding of proteins. Technical Report 99-50, CS Department, Rutgers University, 1999.
15. K. V. R. Kanth, D. Agrawal, and A. Singh. Dimensionality reduction for similarity searching in dynamic databases. In ACM International Conference on Management of Data (SIGMOD), pages 166-176, 1998.
16. E. Keogh. Exact indexing of dynamic time warping. In International Conference on Very Large Data Bases, pages 406-417, 2002.
17. E. Keogh and M. Pazzani. Scaling up dynamic time warping for data mining applications. In Proc. of SIGKDD, 2000.
18. E. Keogh, X. Xi, L. Wei, and C. A. Ratanamahatana. The UCR time series classification/clustering homepage: www.cs.ucr.edu/~eamonn/time-series-data/, 2006.
19. N. Koudas, B. C. Ooi, H. T. Shen, and A. K. H. Tung. LDC: Enabling search by partial distance in a hyper-dimensional space. In IEEE International Conference on Data Engineearing, pages 6-17, 2004.
20. J. B. Kruskall and M. Liberman. The symmetric time warping algorithm: From continuous to discrete. In Time Warps. Addison-Wesley, 1983.
21. H. Lee and J. Kim. An HMM-based threshold model approach for gesture recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(10):961-973, October 1999.
22. C. Li, E. Chang, H. Garcia-Molina, and G. Wiederhold. Clustering for approximate similarity search in high-dimensional spaces. IEEE Transactions on Knowledge and Data Engineering, 14(4):792-808, 2002.
23. Y. Moon, K. Whang, and W. Han. General match: a subsequence matching method in time-series databases based on generalized windows. In ACM International Conference on Management of Data (SIGMOD), pages 382-393, 2002.
24. Y. Moon, K. Whang, and W. Loh. Duality-based subsequence matching in time-series databases. In IEEE International Conference on Data Engineering (ICDE), pages 263-272, 2001.
25. P. Morguet and M. Lang. Spotting dynamic hand gestures in video image sequences using hidden Markov models. In IEEE International Conference on Image Processing, pages 193-197, 1998.
26. R. Oka. Spotting method for classification of real world data. The Computer Journal, 41(8):559-565, July 1998.
27. S. Park, W. W. Chu, J. Yoon, and J. Won. Similarity search of time-warped subsequences via a suffix tree. Information Systems, 28(7), 2003.
28. S. Park, S. Kim, and W. W. Chu. Segment-based approach for subsequence searches in sequence databases. In Symposium on Applied Computing, pages 248-252, 2001.
29. D. Rafiei and A. O. Mendelzon. Similarity-based queries for time series data. In ACM International Conference on Management of Data (SIGMOD), pages 13-25, 1997.
30. T. M. Rath and R. Manmatha. Word image matching using dynamic time warping. In IEEE Conference on Computer Vision and Pattern Recognition (CVPR), volume 2, pages 521-527, 2003.
31. Y. Sakurai, C. Faloutsos, and M. Yamamuro. Stream monitoring under the time warping distance. In IEEE International Conference on Data Engineering (ICDE), 2007.
32. Y. Sakurai, M. Yoshikawa, and C. Faloutsos. FTW: fast similarity search under the time warping distance. In Principles of Database Systems (PODS), pages 326-337, 2005.
33. Y. Sakurai, M. Yoshikawa, S. Uemura, and H. Kojima. The A-tree: An index structure for high-dimensional spaces using relative approximation. In International Conference on Very Large Data Bases, pages 516-526, 2000.
34. Y. Shou, N. Mamoulis, and D. W. Cheung. Fast and exact warping of time series using adaptive segmental approximations. Machine Learning, 58(2-3):231-267, 2005.
35. E. Tuncel, H. Ferhatosmanoglu, and K. Rose. VQ-index: An index structure for similarity searching in multimedia databases. InProc. of ACM Multimedia, pages 543-552, 2002.
36. J. Venkateswaran, D. Lachwani, T. Kahveci, and C. Jermaine. Reference-based indexing of sequence databases. In International Conference on Very Large Databases (VLDB), pages 906-917, 2006.
37. M. Vlachos, M. Hadjieleftheriou, D. Gunopulos, and E. Keogh. Indexing multi-dimensional time-series with support for multiple distance measures. In ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 216-225, 2003.
38. X. Wang, J. T. L. Wang, K. I. Lin, D. Shasha, B. A. Shapiro, and K. Zhang. An index structure for data mining and clustering. Knowledge and Information Systems, 2(2): 161-184, 2000.
39. R. Weber and K. Böhm. Trading quality for time with nearest-neighbor search. In International Conference on Extending Database Technology: Advances in Database Technology, pages 21-35, 2000.
40. R. Weber, H.-J. Schek, and S. Blott. A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces. In International Conference on Very Large Data Bases, pages 194-205, 1998.
41. D. A. White and R. Jain. Similarity indexing: Algorithms and performance. In Storage and Retrieval for Image and Video Databases (SPTE), pages 62-73, 1996.
42. H. Wu, B. Salzberg, G. C. Sharp, S. B. Jiang, H. Shirato, and D. R. Kaeli. Subsequence matching on structured time series data. In ACM International Conference on Management of Data (SIGMOD), pages 682-693, 2005.
43. B.-K. Yi, H. V. Jagadish, and C. Faloutsos. Efficient retrieval of similar time sequences under time warping. In IEEE International Conference on Data Engineering, pages 201-208, 1998.
44. Y. Zhu and D. Shasha. Warping indexes with envelope transforms for query by humming. In ACM International Conference on Management of Data (SIGMOD), pages 181-192, 2003.