Abstract
Time series motif discovery is important as the discovered motifs generally form the primitives for many data mining tasks. In this work, we examine the problem of discovering groups of motifs from different time series that exhibit some lag relationships. We define a new class of pattern called lagPatterns that captures the invariant ordering among motifs. lagPatterns characterize localized associative pattern involving motifs derived from each entity and explicitly accounts for lag across multiple entities. We present an exact algorithm that makes use of the order line concept and the subsequence matching property of the normalized time series to find all motifs of various lengths. We also describe a method called LPMiner to discover lagPatterns efficiently. LPMiner utilizes inverted index and motif alignment technique to reduce the search space and improve the efficiency. A detailed empirical study on synthetic datasets shows the scalability of the proposed approach. We show the usefulness of lagPatterns discovered from a stock dataset by constructing stock portfolio that leads to a higher cumulative rate of return on investment.
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
Chiu, B., Keogh, E., Lonardi, S.: Probabilistic discovery of time series motifs. In: SIGKDD, pp. 493–498 (2003)
Cormen, T., Leiserson, E., Rivest, L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)
Das, G., Lin, K., Mannila, H., Renganathan, G., Smyth, P.: Rule discovery from time series. In: SIGKDD, pp. 16–22 (1998)
Gsli, H., Samet, H.: Properties of embedding methods for similarity search in metric spaces. In: PAMI, pp. 530–549 (2003)
Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)
Keogh, E., Kasetty, S.: On the need for time series data mining benchmarks: A survey and empirical demonstration. DMKD 7(4), 349–371 (2003)
Keogh, E., Lin, J.: Clustering of time-series subseq. is meaningless: implications for previous and future research. KIS 8(2), 154–177 (2005)
Lin, J., Keogh, E., Lonardi, S., Patel, P.: Finding motifs in time series. In: Temporal Data Mining (2002)
Loh, W., Kim, S., Whang, K.: A subsequence matching algorithm that supports normalization transform in time-series databases. DMKD, 5–28 (2004)
Minnen, D., Isbell, C.L., Essa, I., Starner, T.: Discovering multivariate motifs using subsequence density estimation and greedy mixture learning. In: AAAI (2007)
Mueen, A., Keogh, E., Bigdely-Shamlo, N.: A disk-aware algorithm for time series motif discovery. In: ICDM (2009)
Mueen, A., Keogh, E., Zhu, Q., Cash, S.: Exact discovery of time series motifs. In: SDM (2009)
Oates, T.: Peruse: An unsupervised algorithm for finding recurring patterns in time series. In: ICDM, pp. 330–337 (2002)
Vahdatpour, A., Amini, N., Sarrafzadeh, M.: Toward unsupervised activity discovery using multi-dimensional motif detection in time series. In: IJCAI (2009)
Wu, D., Fung, G.P.C., Yu, J.X., Liu, Z.: Mining multiple time series co-movements. In: Zhang, Y., Yu, G., Bertino, E., Xu, G. (eds.) APWeb 2008. LNCS, vol. 4976, pp. 572–583. Springer, Heidelberg (2008)
Yoshiki, T., Kazuhisa, I., Kuniaki, U.: Discovery of time-series motif from multi-dimensional data based on mdl principle. Machine Learning 58(2-3), 269–300 (2005)
Zhu, Y., Shasha, D.: Statstream: Statistical monitoring of thousands of data streams in real time. In: VLDB (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patel, D., Hsu, W., Lee, M.L., Parthasarathy, S. (2010). Lag Patterns in Time Series Databases. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds) Database and Expert Systems Applications. DEXA 2010. Lecture Notes in Computer Science, vol 6262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15251-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-15251-1_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15250-4
Online ISBN: 978-3-642-15251-1
eBook Packages: Computer ScienceComputer Science (R0)