Abstract
The interactive exploration of time series is an important task in data analysis. In this paper, we concentrate on the investigation of linear correlations between time series. Since the correlation of time series might change over time, we consider the analysis of all possible subsequences of two time series. Such an approach allows identifying, at different levels of window length, periods over which two time series correlate and periods over which they do not correlate. We provide a solution to compute the correlations over all window lengths in \(O(n^2)\) time, which is the size of the output and hence the best we can achieve. Furthermore, we propose a visualization of the result in the form of a heatmap, which provides a compact overview on the structure of the correlations amenable for a data analyst. An experimental evaluation shows that the tool is efficient to allow for interactive data exploration.
This work was supported by the European Regional Development Fund - Investment for Growth and Jobs Programme 2014–2020 in the context of the PREMISE project (FESR1164).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Alseghayer, R., Petrov, D., Chrysanthis, P.K., Sharaf, M., Labrinidis, A.: Detection of highly correlated live data streams. In: Proceedings of the International Workshop on Real-Time Business Intelligence and Analytics, BIRTE 2017. Association for Computing Machinery, New York (2017). https://doi.org/10.1145/3129292.3129298
Esling, P., Agon, C.: Time-series data mining. ACM Comput. Surv. 45(1), 1–34 (2012). https://doi.org/10.1145/2379776.2379788
Fu, T.C.: A review on time series data mining. Eng. Appl. Artif. Intell. 24(1), 164–181 (2011). https://doi.org/10.1016/j.engappai.2010.09.007
Keogh, E., Chakrabarti, K., Pazzani, M., Mehrotra, S.: Dimensionality reduction for fast similarity search in large time series databases. Knowl. Inf. Syst. 3(3), 263–286 (2001). https://doi.org/10.1007/pl00011669
Keogh, E., Lin, J., Fu, A.: Hot sax: efficiently finding the most unusual time series subsequence. In: Proceedings of the Fifth IEEE International Conference on Data Mining, ICDM 2005, pp. 226–233. IEEE Computer Society, USA (2005). https://doi.org/10.1109/ICDM.2005.79
Li, Y., U, L.H., Yiu, M.L., Gong, Z.: Discovering longest-lasting correlation in sequence databases. Proc. VLDB Endow. 6(14), 1666–1677 (2013). https://doi.org/10.14778/2556549.2556552
Papadimitriou, S., Sun, J., Faloutsos, C.: Streaming pattern discovery in multiple time-series. In: Proceedings of the 31st International Conference on Very Large Data Bases, VLDB 2005, pp. 697–708. VLDB Endowment (2005)
Patel, P., Keogh, E.J., Lin, J., Lonardi, S.: Mining motifs in massive time series databases. In: Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM 2002), 9–12 December 2002, Maebashi City, Japan, pp. 370–377. IEEE Computer Society (2002). https://doi.org/10.1109/ICDM.2002.1183925
Rong, K., Bailis, P.: ASAP: prioritizing attention via time series smoothing. Proc. VLDB Endow. 10(11), 1358–1369 (2017). https://doi.org/10.14778/3137628.3137645
Sakurai, Y., Papadimitriou, S., Faloutsos, C.: Braid: stream mining through group lag correlations. In: Proceedings of the 2005 ACM SIGMOD International Conference on Management of Data, SIGMOD 2005, pp. 599–610. Association for Computing Machinery, New York (2005). https://doi.org/10.1145/1066157.1066226
Sobel, J., Bertram, N., Ding, C., Nargesian, F., Gildea, D.: AWLCO: all-window length co-occurrence. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 191, pp. 24:1–24:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Dagstuhl, Germany (2021). https://doi.org/10.4230/LIPIcs.CPM.2021.24. https://drops.dagstuhl.de/opus/volltexte/2021/13975
Ye, L., Keogh, E.: Time series shapelets: a new primitive for data mining. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2009, pp. 947–956. Association for Computing Machinery, New York (2009). https://doi.org/10.1145/1557019.1557122
Yeh, C.C.M., et al.: Matrix profile i: all pairs similarity joins for time series: a unifying view that includes motifs, discords and shapelets. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 1317–1322 (2016). https://doi.org/10.1109/ICDM.2016.0179
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Charane, A., Ceccarello, M., Dignös, A., Gamper, J. (2022). Efficient Computation of All-Window Length Correlations. In: Ivanovic, M., Kirikova, M., Niedrite, L. (eds) Digital Business and Intelligent Systems. Baltic DB&IS 2022. Communications in Computer and Information Science, vol 1598. Springer, Cham. https://doi.org/10.1007/978-3-031-09850-5_17
Download citation
DOI: https://doi.org/10.1007/978-3-031-09850-5_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09849-9
Online ISBN: 978-3-031-09850-5
eBook Packages: Computer ScienceComputer Science (R0)