Issue No.03 - May/June (2003 vol.15)
<p><b>Abstract</b>—Periodicy detection in time series data is a challenging problem of great importance in many applications. Most previous work focused on mining synchronous periodic patterns and did not recognize the misaligned presence of a pattern due to the intervention of random noise. In this paper, we propose a more flexible model of asynchronous periodic pattern that may be present only within a subsequence and whose occurrences may be shifted due to disturbance. Two parameters <em>min_rep</em> and <em>max_dis</em> are employed to specify the minimum number of repetitions that is required within each segment of nondisrupted pattern occurrences and the maximum allowed disturbance between any two successive valid segments. Upon satisfying these two requirements, the longest valid subsequence of a pattern is returned. A two-phase algorithm is devised to first generate potential periods by distance-based pruning followed by an iterative procedure to derive and validate candidate patterns and locate the longest valid subsequence. We also show that this algorithm cannot only provide linear time complexity with respect to the length of the sequence but also achieve space efficiency.</p>
Asynchronous periodic pattern, segment-based approach, partial periodicity.
Wei Wang, Jiong Yang, "Mining Asynchronous Periodic Patterns in Time Series Data", IEEE Transactions on Knowledge & Data Engineering, vol.15, no. 3, pp. 613-628, May/June 2003, doi:10.1109/TKDE.2003.1198394