Abstract
Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aref W, Elfeky M, Elmagarmid A (2004) Incremental, online, and merge mining of partial periodic patterns in time-series databases. IEEE Trans Knowledge Data Eng
Berberidis C, Aref W, Atallah M, Vlahavas I, Elmagarmid A (2002) Multiple and partial periodicity mining in time series databases. In: Proceedings of the European conference on artificial intellegence, pp 370–374
Box P, Jenkins M, Reinsel C (1994) Time series analysis, forecasting and control. Prentice-Hall
Brown GR (1963) Smoothing, forecasting and prediction. Prentice-Hall
Chakrabarti K, Mehrotra S (2000) Local dimensionality reduction: a new approach to indexing high dimensional spaces. In: Proceedings of VLDB, pp 89–100
Chatfield C, Yar M (1988) Holt—Winters forecasting: some practical issues. The Statistician, pp 129–140
Cui B, Ooi BC, Su J, Tan K-L (2003) Contorting high dimensional data for efficient main memory KNN processing. In: Proceedings of ACM-SIGMOD
Elfeky M, Aref W, Elmagarmid A (2004) Using convolution to mine obscure periodic patterns in one pass. In: Proceedings of EDBT, pp 605–620
Farnum RN, Stanton WL (1989) Quantitative forecasting methods. PWS-Kent
Fox J (1997) Applied regression analysis, linear models, and related methods. Sage Publications, Thousand Oaks, CA
Gardner SE, McKenzie E (1985) Forecasting trends in time series. Manage Sci, pp 1237–1246
Han J, Dong G, Yin Y (1999) Efficient mining of partial periodic patterns in time series database. In: Proceedings of ICDE, pp 106–115
Han J, Gong W, Yin Y (1998) Mining segment-wise periodic patterns in time-related databases. In: Proceedings of international conference in knowledge discovery and data mining, pp 214–218
Hipel K, McLeo AI (1994) Time series modelling of water resources and environmental systems. Elsevier
Hui J, Ooi BC, Shen H, Yu C (2003) An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing. In: Proceedings of ICDE, pp 87–99
Indyk P, Koudas N, Muthukrishnan S (2000) Identifying representative trends in massive time series data sets. In: Proceedings of VLDB, pp 363–372
Jolliffe I (1986) Principal component analysis. Springer-Verlag
Ma S, Hellerstein J (2001) Mining partially periodic event patterns with unknown periods. In: Proceedings of ICDE, pp 205–214
Ord KJ, Koehler BA, Snyder DR (1997) Estimation and prediction for a class of dynamic nonlinear statistical models. J Am Stat Assoc 92:1621–1629
Shlens J (in press) A tutorial on principal component analysis. http://www.snl.salk.edu/~shlens/pub/notes/pca.pdf
Wang W, Yang J, Yu P (2001) Meta-patterns: revealing hidden periodic patterns. In: Proceedings of ICDM, pp 550–557
Yang J, Wang W, Yu P (2001) Infominer: mining surprising periodic patterns. In: Proceedings of international conference in knowledge discovery and data mining, pp 395–400
Yang J, Wang W, Yu P (2004) Discovering high order periodic patterns. Knowledge Inf Syst J (KAIS) 6(3):243–268
Yang J, Wang W, Yu PS (2000) Mining asynchronous periodic patterns in time series data. In: Proceedings of international conference in knowledge discovery and data mining, pp 275–279
Author information
Authors and Affiliations
Corresponding author
Additional information
Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University.
X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing.
Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University.
Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.
Rights and permissions
About this article
Cite this article
He, Z., Wang, X.S., Lee, B.S. et al. Mining partial periodic correlations in time series. Knowl Inf Syst 15, 31–54 (2008). https://doi.org/10.1007/s10115-006-0051-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10115-006-0051-5