Mining partial periodic correlations in time series

• Published in: Knowledge and information systems Vol. 15; no. 1; pp. 31 - 54
• Main Authors: He, Zhen, Wang, X. Sean, Lee, Byung Suk, Ling, Alan C. H.
• Format: Journal Article
• Language: English
• Published: London Springer-Verlag 01.04.2008; Springer Nature B.V
• Subjects: Algorithms; Computer Science; Data mining; Data Mining and Knowledge Discovery; Database Management; Information Storage and Retrieval; Information systems; Information Systems and Communication Service; Information Systems Applications (incl.Internet); IT in Business; Mining; Principal components analysis; Regular Paper; Securities markets; Studies; Time series; Periodic patterns; Time series mining; Correlations; Principal component analysis
• ISSN: 0219-1377; 0219-3116
• DOI: 10.1007/s10115-006-0051-5

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.