1. Trang chủ
  2. » Luận Văn - Báo Cáo

Kết chuỗi con trên dữ liệu chuỗi thời gian với sự hỗ trợ của cây chỉ mục ts tree

77 14 0

Đang tải... (xem toàn văn)

Tài liệu hạn chế xem trước, để xem đầy đủ mời bạn chọn Tải xuống

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 77
Dung lượng 2,89 MB

Nội dung

Ngày đăng: 28/01/2021, 19:01

Nguồn tham khảo

Tài liệu tham khảo Loại Chi tiết
[1] Fink, E., and Gandhi, H. S.. Compression of Time Series by Extracting Major Extrema. Journal of Experimental & Theoretical Artificial Intelligence. Vol. 23, No. 2, pp. 255-270, 2011 Sách, tạp chí
Tiêu đề: Journal of Experimental & Theoretical Artificial Intelligence
[2] Mueen, A., Hamooni, H., Estrada, T.: Time series join on subsequence correlation. Proc. ICDM 2014, pp. 450–459, 2014 Sách, tạp chí
Tiêu đề: Proc. ICDM 2014
[3] Rakthanmanon, T., Campana, B., Mueen, A., Batista, G., Westover, B., Zhu, Q., Zakaria, J., Keogh, E.: Searching and mining trillions of time series subsequences under dynamic time warping. In: Proceedings. of SIGKDD, 2012 Sách, tạp chí
Tiêu đề: In: Proceedings. of SIGKDD
[4] Fink, E., and Gandhi, H. S. Important Extrema of Time Series. Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Montreal, QC, Canada, pp. 366-372, 2007 Sách, tạp chí
Tiêu đề: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, Montreal
[5] Vo D. V and Duong T. A.. Efficient Subsequence Join over Time Series under Dynamic Time Warping. Recent Developments in Intelligent Information and Database Systems. Studies in Computational Intelligence, Vol 642, Springer, pp. 41-52, 2016 Sách, tạp chí
Tiêu đề: Recent Developments in Intelligent Information and Database Systems. Studies in Computational Intelligence", Vol 642, Springer, pp
[7] Esling, P. and Agon, C.. Time Series Overview. In Proceedings of 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discover, DMKD 2004, California, USA, pp. 30-39, 2004 Sách, tạp chí
Tiêu đề: In Proceedings of 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discover
[8] Huang, Y.W., Jing N., and Rundensteiner, E.A.. Spatial Joins Using R-Trees: Breadth-First Traversal with Global Optimizations. Proc. 23rd Int’l Conf.Very Large Data Bases (VLDB). 1997 Sách, tạp chí
Tiêu đề: Proc. 23rd Int’l Conf
[9] Assent, I., Krieger R., Afschari, F., Seidl T.. The TS-Tree: Efficient Time Series Search and Retrieval, Proc of EDBT’08, Nantes, France, March 25- 30, 2008 Sách, tạp chí
Tiêu đề: Proc of EDBT’08
[11] Ferragina, P. and Grossi, R.. The string b-tree: A new data structure for string search in external memory and its applications. J. ACM, 46(2):236–280, 1999 Sách, tạp chí
Tiêu đề: J. ACM
[13] Ciaccia, P., Patella, M. and Zezula, P.. M-tree An Efficient Acces Method for Similarity Search in Metric Spaces. Proceedings of the 23rd VLDB Conference Athens, Greece, 1997 Sách, tạp chí
Tiêu đề: Proceedings of the 23rd VLDB Conference Athens
[14] Beckmann, N., Kriegel, H.-P., Schneider, R. and Seeger, B.. The R*-tree: an efficient and robust access method for points and rectangles. In Proc.SIGMOD, pages 322–331, 1990 Sách, tạp chí
Tiêu đề: In Proc. "SIGMOD
[15] Keogh, E.. Exact indexing of dynamic time warping. Knowledge and Information Systems. Vol. 7, Issue 3, pp. 358–386, 2005 Sách, tạp chí
Tiêu đề: Knowledge and Information Systems
[16] Sakoe, H. and Chiba, S.. Dynamic programming algorithm optimization for spoken word recognition. In IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. 26, pp. 43-49. 1978 Sách, tạp chí
Tiêu đề: IEEE Transactions on Acoustics, Speech, and Signal Processing
[17] Itakura, F.. Minimum prediction residual principle applied to speech recognition. In IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. ASSP-23, No.1, pp. 67-72. 1975 Sách, tạp chí
Tiêu đề: IEEE Transactions on Acoustics, Speech, and Signal Processing
[18] Ratanamahatana, C. A. and Keogh, E.. Searching and Mining Trillions of Time Series Subsequences under Dynamic Time Warping. SIGKDD, August 12 - 16, 2012, Beijing, China. 2012 Sách, tạp chí
Tiêu đề: SIGKDD, August 12 - 16, 2012, Beijing, China
[20] Brinkhoff, T. Kriegel, H. P., and Seeger, B.. Efficient Processing of Spatial Joins Using R-Trees. Proc. ACM SIGMOD, 1993 Sách, tạp chí
Tiêu đề: Proc. ACM SIGMOD
[21] Keogh, E. (2008). The UCR Time Series Classification/Clustering Homepage: http://www.cs.ucr.edu/~eamonn/time_series_data/ Link
[6] Lin, Y.. Subseries Join and Compression of Time Series Data Based on Non- uniform Segmentation. PhD Thesis, Waterloo, Ontario, Canada. 2008 Khác
[10] Guttman, A.. R-Trees: A Dynamic Index Structure for Spatial Searching. Proceedings of the 1984 ACM SIGMOD international conference on Management of data – SIGMOD '84. p. 47, 1984 Khác

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN