Time series indexing by dynamic covering with cross-range constraints
Abstract
Time series indexing plays an important role in querying and pattern mining of big data. This paper proposes a novel structure for tightly covering a given set of time series under the dynamic time warping similarity measurement. The structure, referred to as dynamic covering with cross-range constraints (DCRC), enables more efficient and scalable indexing to be developed than current hypercube-based partitioning approaches. In particular, a lower bound of the DTW distance from a given query time series to a DCRC-based cover set is introduced. By virtue of its tightness, which is proven theoretically, the lower bound can be used for pruning when querying on an indexing tree. If the DCRC-based lower bound (LB_DCRC) of an upper node in an index tree is larger than a given threshold, all child nodes can be pruned yielding a significant reduction in computational time. A hierarchical DCRC (HDCRC) structure is proposed to generate the DCRC-tree-based indexing and used to develop time series indexing and insertion algorithms. Experimental results for a selection of benchmark time series datasets are presented to illustrate the tightness of LB_DCRC, as well as the pruning efficiency on the DCRC-tree, especially when the time series have large deformations.
References
[1]
Agrawal, R., Faloutsos, C., Swami, A.: Efficient similarity search in sequence databases. In: Proceedings of International Conference on Foundations of Data Organization and Algorithms, pp. 69–84. Springer, Boston, MA (1993)
[2]
Chen CLP and Zhang CY Data-intensive applications, challenges, techniques and technologies: a survey on big data Inf. Sci. 2014 275 314-347
[3]
Dau, H.A., Keogh, E., Kamgar, K., Yeh, C.C.M., Zhu, Y., Gharghabi, S., Ratanamahatana, C.A., Yanping, Hu, B., Begum, N., Bagnall, A., Mueen, A., Batista, G., Hexagon, M.L.: The UCR time series classification archive. https://www.cs.ucr.edu/~eamonn/time_series_data_2018 (2018)
[4]
Edstrom J, Chen D, Gong Y, Wang J, and Gong N Data-pattern enabled self-recovery low-power storage system for big video data IEEE Trans. Big Data 2019 5 1 95-105
[5]
Esling P and Agon C Time-series data mining. ACM Comput. Surv. 2012 45 1 12:1-34
[6]
Fu TC A review on time series data mining Eng. Appl. Artif. Intell. 2011 24 1 164-181
[7]
Grabocka J, Wistuba M, and Schmidt-Thieme L Fast classification of univariate and multivariate time series through shapelet discovery Knowl. Inf. Syst. 2016 49 2 429-454
[8]
Guttman, A.: (1984) R-trees: A dynamic index structure for spatial searching. In: ACM Sigmod International Conference on Management of Data, pp. 47–57. ACM, New York, NY (2018)
[9]
He H and Tan Y Unsupervised classification of multivariate time series using VPCA and fuzzy clustering with spatial weighted matrix distance IEEE Trans. Cybern. 2020 50 3 1096-1105
[10]
Hu J, Yang B, Guo C, and Jensen CS Risk-aware path selection with time-varying, uncertain travel costs: A time series approach VLDB J. 2018 27 2 179-200
[11]
Ignatov A Real-time human activity recognition from accelerometer data using convolutional neural networks Appl. Soft Comput. 2018 62 915-922
[12]
Itakura F Minimum prediction residual principle applied to speech recognition IEEE Trans. Acoust. Speech Signal Process. 1975 23 1 67-72
[13]
Kacprzyk J, Wilbik A, and Zadrożny S Linguistic summarization of time series using a fuzzy quantifier driven aggregation Fuzzy Sets Syst. 2008 159 12 1485-1499
[14]
Keogh E and Ratanamahatana CA Exact indexing of dynamic time warping Knowl. Inf. Syst. 2005 7 3 358-386
[15]
Keogh E, Wei L, Xi X, Vlachos M, Lee SH, and Protopapas P Supporting exact indexing of arbitrarily rotated shapes and periodic time series under Euclidean and warping distance measures VLDB J. 2009 18 3 611-630
[16]
Lemire D Faster retrieval with a two-pass dynamic-time-warping lower bound Pattern Recogn. 2009 42 2169-2180
[17]
Li H and Yang L Extensions and relationships of some existing lower-bound functions for dynamic time warping J., Intell. Inf. Syst. 2014 43 1 59-79
[18]
Li Q, Chen Y, Wang J, Chen Y, and Chen HC Web media and stock markets: A survey and future directions from a big data perspective IEEE Trans. Knowl. Data Eng. 2018 30 2 381-399
[19]
Lin SC, Yeh MY, and Chen MS Non-overlapping subsequence matching of stream synopses IEEE Trans. Knowl. Data Eng. 2018 30 1 101-114
[20]
Liu M, Zhang X, and Xu G Continuous motion classification and segmentation based on improved dynamic time warping algorithm Int. J. Pattern Recognit Artif Intell. 2018 32 2 1850,002
[21]
Mikalsen KØ, Bianchi FM, Soguero-Ruiz C, and Jenssen R Time series cluster kernel for learning similarities between multivariate time series with missing data Pattern Recogn. 2018 76 569-581
[22]
Mondal T, Ragot N, Ramel JY, and Pal U Comparative study of conventional time series matching techniques for word spotting Pattern Recogn. 2018 73 47-64
[23]
Mori U, Mendiburu A, and Lozano JA Similarity measure selection for clustering time series databases IEEE Trans. Knowl. Data Eng. 2016 28 1 181-195
[24]
Mueen A, Chavoshi N, Abu-El-Rub N, Hamooni H, Minnich A, and MacCarthy J Speeding up dynamic time warping distance for sparse time series data Knowl. Inf. Syst. 2018 54 1 237-263
[25]
Mueen, A., Keogh, E.: Extracting optimal performance from dynamic time warping. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 2129–2130. ACM, New York, NY (2016)
[26]
Park, S., Lee, D., Chu, W.W.: Fast retrieval of similar subsequences in long sequence databases. In: Proceedings of 1999 Workshop on Knowledge and Data Engineering Exchange, pp. 60–67. IEEE, Chicago, IL (1999)
[27]
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 the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 262–270. ACM, New York, NY (2012)
[28]
Sakoe H and Chiba S Dynamic programming algorithm optimization for spoken word recognition IEEE Trans. Acoust. Speech Signal Process. 1978 26 1 43-49
[29]
Shen, Y., Chen, Y., Keogh, E., Jin, H.: Accelerating time series searching with large uniform scaling. In: Proceedings of the 2018 SIAM International Conference on Data Mining, pp. 234–242. SIAM, Bologna, Italy (2018)
[30]
Son NT and Anh DT Discovery of time series -motifs based on multidimensional index Knowl. Inf. Syst. 2016 46 1 59-86
[31]
Sun T, Liu H, Yu H, and Chen CLP Degree-pruning dynamic planning approaches to central time series through minimizing dynamic time warping distance IEEE Trans. Cybern. 2017 47 7 1719-1729
[32]
Tan, C.W., Petitjean, F., Webb, G.: Elastic bands across the path: a new framework and method to lower bound DTW. In: Proceedings of the 2019 SIAM International Conference on Data Mining, pp. 522–530. SIAM, Alberta, Canada (2019)
[33]
Tan, C.W., Webb, G.I., Petitjean, F.: Indexing and classifying gigabytes of time series under time warping. In: Proceedings of the 2017 SIAM International Conference on Data Mining, pp. 282–290. SIAM, Houston, TX (2017)
[34]
Tan Z, Wang Y, Zhang Y, and Zhou J A novel time series approach for predicting the long-term popularity of online videos IEEE Trans. Broadcast. 2016 62 2 436-445
[35]
Tang J, Cheng H, Zhao Y, and Guo H Structured dynamic time warping for continuous hand trajectory gesture recognition Pattern Recogn. 2018 80 21-31
[36]
Wu X, Zhu X, Wu G, and Ding W Data mining with big data IEEE Trans. Knowl. Data Eng. 2014 26 1 97-107
[37]
Wu Y, Tong Y, Zhu X, and Wu X NOSEP: Nonoverlapping sequence pattern mining with gap constraints IEEE Trans. Cybern. 2018 48 10 2809-2822
[38]
Yi, B.K., Jagadish, H.V., Faloutsos, C.: Efficient retrieval of similar time sequences under time warping. In: Proceedings of the 14th International Conference on Data Engineering, pp. 201–208. IEEE, Orlando, FL (1998)
[39]
Zhou M and Wong MH Boundary-based lower-bound functions for dynamic time warping and their indexing Inf. Sci. 2011 181 19 4175-4196
[40]
Zoumpatianos K, Lou Y, Ileana I, Palpanas T, and Gehrke J Generating data series query workloads VLDB J. 2018 27 6 823-846
Index Terms
- Time series indexing by dynamic covering with cross-range constraints
Index terms have been assigned to the content through auto-classification.
Recommendations
Exact indexing of dynamic time warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has been forcefully shown that the Euclidean distance is a very brittle ...
Exact indexing for massive time series databases under time warping distance
Among many existing distance measures for time series data, Dynamic Time Warping (DTW) distance has been recognized as one of the most accurate and suitable distance measures due to its flexibility in sequence alignment. However, DTW distance ...
Worst-case efficient range search indexing: invited tutorial
PODS '09: Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsIn this tutorial we will describe some of the recent advances in the development of worst-case efficient range search indexing structures, that is, structures for storing a set of data points such that the points in a axis-parallel (hyper-) query ...
Comments
Information & Contributors
Information
Published In
© Springer-Verlag GmbH Germany, part of Springer Nature 2020.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 28 May 2020
Accepted: 16 April 2020
Revision received: 24 February 2020
Received: 31 July 2019
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Feb 2025