Abstract
We extract the relation among multiple time series in which a characteristic pattern in a time series follows a similar pattern in another time series. We call this a ‘post-hoc-relation’. For extracting many post-hoc-relations from a large number of time series, we investigated the problem of reducing the cost of online searching for the top-k similar time-lagged pattern pairs in multiple time series, where k is the query size. We propose an online top-k similar time-lagged pattern pair search method that manages the candidate cache in preparation for the top-k pair update and defines the upper bound distance for each arrival time of pattern pairs. Our method also prunes dissimilar pattern pairs by using an index and the upper bound distance. Experimental results show that our method successfully reduces the number of distance computations for a top-k similar pattern update.
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
Preview
Unable to display preview. Download preview PDF.
References
Assent, I., Krieger, R., Afschari, F., Seidl, T.: The ts-tree: efficient time series search and retrieval. In: EDBT (2008)
Castro, N., Azevedo, P.: Multiresolution motif discovery in time series. In: SDM (2010)
Chen, Q., Chen, L., Lian, X., Liu, Y., Yu, J.X.: Indexable pla for efficient similarity search. In: VLDB (2007)
Chevez, E., Navarro, G.: A compact space decomposition for effective metric indexing. Pattern Recognition Letters 24(9), 1363–1376 (2005)
Ciaccia, P., Patella, M., Zezula, P.: M-tree: An efficient access method for similarity search in metric spaces. In: VLDB (1997)
Gandhi, S., Nath, S., Suri, S., Liu, J.: Gamps: compressing multi sensor data by grouping and amplitude scaling. In: SIGMOD (2009)
Lam, H.T., Calders, T., Pham, N.: Online discovery of top-k similar motifs in time series data. In: SDM (2011)
Jagadish, H.V., Ooi, B.C., Tran, K.L., Yu, C., Zhang, R.: idistance: An adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans. on Database Systems (TODS) 30(2), 364–397 (2003)
Lin, J., Keogh, E., Lonardi, S., Chiu, B.: A symbolic representation of time series, with implications for streaming algorithms. In: DMKD (2003)
Lin, J., Keogh, E., Lonardi, S., Patel, P.: Finding motifs in time series. In: SIGKDD (2002)
Mueen, A., Keogh, E.: Online discovery and maintenance of time series motifs. In: KDD (2010)
Mueen, A., Nath, S., Liu, J.: Fast approximate correlation for massive time-series data. In: SIGMOD (2010)
Navarro, G., Reyes, N.: Dynamic spatial approximation trees. Journal of Experimental Algorithmics 12, 1.5:1–1.5:68 (2008)
Uhlmann, J.K.: Satisfying general proximity/similarity queries with metric trees. Information Processing Letters 40(4), 175–179 (1991)
Yankov, D., Keogh, E., Medina, J., Chiu, B., Zordan, V.: Detecting time series motifs under uniform scaling. In: KDD (2007)
Zezula, P., Amato, G., Dohnal, V., Batko, M.: Similarity Search: The Metric Space Approach (Advances in Database Systems). Springer (2005)
Zhang, T., Yue, D., Gu, Y., Yu, G.: Boolean representation based data-adaptive correlation analysis over time series streams. In: CIKM (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kurasawa, H., Sato, H., Nakamura, M., Matsumura, H. (2012). Online Top-k Similar Time-Lagged Pattern Pair Search in Multiple Time Series. In: Liddle, S.W., Schewe, KD., Tjoa, A.M., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2012. Lecture Notes in Computer Science, vol 7447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32597-7_38
Download citation
DOI: https://doi.org/10.1007/978-3-642-32597-7_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32596-0
Online ISBN: 978-3-642-32597-7
eBook Packages: Computer ScienceComputer Science (R0)