Abstract
Given ε ∈ [0, 1), the ε-Relative Error Periodic Pattern Problem (REPP) is the following:
INPUT: An n-long sequence S of numbers s i ∈ ℕ in increasing order.
OUTPUT: The longest ε-relative error periodic pattern, i.e., the longest subsequence \(s_{i_1}, s_{i_2},\ldots, s_{i_k}\) of S, for which there exists a number p such that the absolute difference between any two consecutive numbers in the subsequence is at least p and at most p(1 + ε).
The best known algorithm for this problem has O(n 3) time complexity. This bound is too high for large inputs in practice. In this paper we give a new algorithm for finding the longest ε-relative error periodic pattern (the REPP problem). Our method is based on a transformation of the input sequence into a different representation: the ε-active maximal intervals list L, defined in this paper. We show that the transformation of S to the list L can be done efficiently (quadratic in n and linear in the size of L) and prove that our algorithm is linear in the size of L. This enables us to prove that our algorithm works in sub-cubic time on inputs for which the best known algorithm works in O(n 3) time. Moreover, though it may happen that our algorithm would still be cubic, it is never worse than the known O(n 3)-algorithm and in many situations its complexity is O(n 2) time.
Keywords
- Input Sequence
- Arithmetic Progression
- Periodic Pattern
- Maximal Interval
- Active Interval
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bagchi, S., Hung, E., Iyengar, A., Vogl, N.G., Wadia, N.: Capacity planning tools for web and grid environments. In: Proc. 1st International Conference on Performance Evaluation Methodolgies and Tools, VALUETOOLS (2006) ISBN = 1-59593-504-5, article number 25, http://doi.acm.org/10.1145/1190095
Gfeller, B.: Finding Longest Approximate Periodic Patterns. In: Dehne, F., Iacono, J., Sack, J.-R. (eds.) WADS 2011. LNCS, vol. 6844, pp. 463–474. Springer, Heidelberg (2011)
Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: Proc. of the 15th International Conference on Data Engineering (ICDE 1999), pp. 106–115. IEEE Computer Society (1999)
Ma, S., Hellerstein, J.L.: Mining partially periodic event patterns with unknown periods. In: The 17th International Conference on Data Engineering (ICDE), pp. 205–214. IEEE Computer Society (2001)
Federal Highway Administration U.S. Department of Transportation, Conjestion: a national issue (August 2011), http://www.ops.fhwa.dot.gov/aboutus/opstory.htm
Panteleenko, V.V.: Instantaneous offloading of web server loads, Ph.D. thesis. University of Notre Dame (2002)
Rasheed, F., Alshalalfa, M., Alhajj, R.: Efficient periodicity mining in time series databases using suffix trees. IEEE Transactions on Knowledge and Data Engineering 99(preprints) (2010)
Tanbeer, S., Ahmed, C., Jeong, B.-S., Lee, Y.-K.: Discovering Periodic-Frequent Patterns in Transactional Databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol. 5476, pp. 242–253. Springer, Heidelberg (2009)
Yang, J., Wang, W., Yu, P.S.: Mining asynchronous periodic patterns in time series data. IEEE Trans. on Knowl. and Data Eng. (15), 613–628 (2003)
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
Amir, A., Apostolico, A., Eisenberg, E., Landau, G.M., Levy, A., Lewenstein, N. (2012). Detecting Approximate Periodic Patterns. In: Even, G., Rawitz, D. (eds) Design and Analysis of Algorithms. MedAlg 2012. Lecture Notes in Computer Science, vol 7659. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34862-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-34862-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34861-7
Online ISBN: 978-3-642-34862-4
eBook Packages: Computer ScienceComputer Science (R0)
