Skip to main content

Using Convolution to Mine Obscure Periodic Patterns in One Pass

  • Conference paper
Advances in Database Technology - EDBT 2004 (EDBT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2992))

Included in the following conference series:

Abstract

The mining of periodic patterns in time series databases is an interesting data mining problem that can be envisioned as a tool for forecasting and predicting the future behavior of time series data. Existing periodic patterns mining algorithms either assume that the periodic rate (or simply the period) is user-specified, or try to detect potential values for the period in a separate phase. The former assumption is a considerable disadvantage, especially in time series databases where the period is not known a priori. The latter approach results in a multi-pass algorithm, which on the other hand is to be avoided in online environments (e.g., data streams). In this paper, we develop an algorithm that mines periodic patterns in time series databases with unknown or obscure periods such that discovering the period is part of the mining process. Based on convolution, our algorithm requires only one pass over a time series of length n, with O(n log n) time complexity.

This work has been supported in part by the National Science Foundation under grants IIS-0093116, EIA-9972883, IIS-0209120, and by grants from NCR and Wal-Mart.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrahamson, K.: Generalized String Matching. SIAM Journal on Computing 16(6), 1039–1051 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  2. Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th Int. Conf. on Very Large Databases, Santiago, Chile (September 1994)

    Google Scholar 

  3. Agrawal, R., Srikant, R.: Mining Sequential Patterns. In: Proc. of the 11th Int. Conf. on Data Engineering, Taipei, Taiwan (March 1995)

    Google Scholar 

  4. Aref, W., Elfeky, M., Elmagarmid, A.: Incremental, Online, and Merge Mining of Partial Periodic Patterns in Time-Series Databases. IEEE Transactions on Knowledge and Data Engineering (to appear)

    Google Scholar 

  5. Ayres, J., Gehrke, J., Yiu, T., Flannick, J.: Sequential Pattern Mining using A Bitmap Representation. In: Proc. of the 8th Int. Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada (July 2002)

    Google Scholar 

  6. Berberidis, C., Aref, W., Atallah, M., Vlahavas, I., Elmagarmid, A.: Multiple and Partial Periodicity Mining in Time Series Databases. In: Proc. of the 15th Euro. Conf. on Artificial Intelligence, Lyon, France (July 2002)

    Google Scholar 

  7. Bettini, C., Wang, X., Jajodia, S., Lin, J.: Discovering Frequent Event Patterns with Multiple Granularities in Time Sequences. IEEE Transactions on Knowledge and Data Engineering 10(2), 222–237 (1998)

    Article  Google Scholar 

  8. Cormen, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. The MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  9. Daw, C., Finney, C., Tracy, E.: A Review of Symbolic Analysis of Experimental Data. Review of Scientific Instruments 74(2), 915–930 (2003)

    Article  Google Scholar 

  10. Garofalakis, M., Rastogi, R., Shim, K.: SPIRIT: Sequential Pattern Mining with Regular Expression Constraints. In: Proc. of the 25th Int. Conf. on Very Large Databases, Edinburgh, Scotland, UK (September 1999)

    Google Scholar 

  11. Han, J., Dong, G., Yin, Y.: Efficient Mining of Partial Periodic Patterns in Time Series Databases. In: Proc. of the 15th Int. Conf. on Data Engineering, Sydney, Australia (March 1999)

    Google Scholar 

  12. Han, J., Gong, W., Yin, Y.: Mining Segment-Wise Periodic Patterns in Time Related Databases. In: Proc. of the 4th Int. Conf. on Knowledge Discovery and Data Mining, New York City, New York (August 1998)

    Google Scholar 

  13. Indyk, P., Koudas, N., Muthukrishnan, S.: Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. In: Proc. of the 26th Int. Conf. on Very Large Data Bases, Cairo, Egypt (September 2000)

    Google Scholar 

  14. Keogh, E., Lonardi, S., Chiu, B.: Finding Surprising Patterns in a Time Series Database in Linear Time and Space. In: Proc. of the 8th Int. Conf. on Knowledge Discovery and Data Mining, Edmonton, Alberta, Canada (July 2002)

    Google Scholar 

  15. Knuth, D.: The Art of Computer Programming, vol. 2. Addison-Wesley, Reading (1981)

    MATH  Google Scholar 

  16. Ma, S., Hellerstein, J.: Mining Partially Periodic Event Patterns with Unknown Periods. In: Proc. of the 17th Int. Conf. on Data Engineering, Heidelberg, Germany (April 2001)

    Google Scholar 

  17. Ozden, B., Ramaswamy, S., Silberschatz, A.: Cyclic Association Rules. In: Proc. of the 14th Int. Conf. on Data Engineering, Orlando, Florida (February 1998)

    Google Scholar 

  18. Srikant, R., Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Proc. of the 5th Int. Conf. on Extending Database Technology, Avignon, France (March 1996)

    Google Scholar 

  19. Vitter, J.: External Memory Algorithms and Data Structures: Dealing with Massive Data. ACM Computing Surveys 33(2), 209–271 (2001)

    Article  Google Scholar 

  20. Yang, J., Wang, W., Yu, P.: Mining Asynchronous Periodic Patterns in Time Series Data. In: Proc. of the 6th Int. Conf. on Knowledge Discovery and Data Mining, Boston, Massachusetts (August 2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Elfeky, M.G., Aref, W.G., Elmagarmid, A.K. (2004). Using Convolution to Mine Obscure Periodic Patterns in One Pass. In: Bertino, E., et al. Advances in Database Technology - EDBT 2004. EDBT 2004. Lecture Notes in Computer Science, vol 2992. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24741-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24741-8_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21200-3

  • Online ISBN: 978-3-540-24741-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics