Skip to main content

Mining Partially Periodic Patterns With Unknown Periods From Event Stream

  • Chapter
Pattern Recognition and String Matching

Part of the book series: Combinatorial Optimization ((COOP,volume 13))

Abstract

Temporal, periodic behavior is common in many application data [6][7][11] including web logs, stock data, alarms of telecommunications, and event logs of computer networks. This is because of routine behaviors of humane (e.g. morning rush every work day), seasonal effects (e.g. increase sales of stationary before a semester), or a consequence of routine tasks (e.g. rebooting print servers every morning or checking stock prices every 10 minutes). An example in computer system is that five repetitions every 10 minutes of a port-down event followed by a port-up event, which in turn is followed by a random gap until the next repetitions of these events. In fact, our study of event logs in production computer networks found that over 50% of the events can be explained by periodic temporal patterns.

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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. R. Agrawal, T. Imielinski, and A. Swami Mining association rules between sets of items in large databases. In Proc. of VLDB, pages 207–216, 1993.

    Google Scholar 

  2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. of VLDB, 1994.

    Google Scholar 

  3. R. Agrawal and R. Srikant Mining sequential patterns. In Proc. of the 11th Intl Conference on Data Engineering, Taipei, Taiwan, 1995.

    Google Scholar 

  4. C. Bettini, X. Wang, and S. Jajodia. Mining temporal relationships with multiple granularities in time sequences. Data Engineering Bulletin, 21: 32–38, 1998.

    Google Scholar 

  5. R. Cooley, J. Srivastava, and B. Mobasher. Web mining. Information and pattern discovery on the world wide web. In Proceedings of the 9th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’97), 1997.

    Google Scholar 

  6. J. Han, G. Dong, and Y. Yin. Efficient mining of partially periodic patterns in time series database. In Int. Conf. Data Engineering, 1999.

    Google Scholar 

  7. J. Han, W. Gong, and Y. Yin. Mining segment-wise periodic patterns in time-related database. In Int’l Conf. on Knowledge Discovery and Data Mining, 1998.

    Google Scholar 

  8. H.O. Lancaster. The Chi-squared distibution. John Wiley & Sons, New York, 1969.

    Google Scholar 

  9. H. Mannila, H. Toivonen, and A. Verkamo. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery, 1(3), 1997.

    Google Scholar 

  10. T. Oates, M. Schmill, D. Jensen, and P. Cohen. A family of algorithms for finding temporal structure in data. In 6th Intl. Workshop on AI and Statistics, 1997.

    Google Scholar 

  11. B. Ozden, S. Ramaswamy, and A. Silberschatz. Cyclic association rules. In Int. Conf. Data Engineering, pages 412–421, 1998.

    Google Scholar 

  12. S.M. Roos. Introduction to probability and statistics for engineers and scientists. John Wiley & Sons, New York, 1987.

    Google Scholar 

  13. R. Srikant and R. Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proc. of the Fifth Int’l Conference on Extending Database Technology (EDBT). Avignon, France., 1996.

    Google Scholar 

  14. O. Zaane, M. Xin, and J. Han. Discovering web access patterns and trends by applying olap and data mining technology on web logs. In Proc. Advances in Digital Libraries ADL’98, pages 19–29, 1998.

    Google Scholar 

  15. M. Zaki. Fast mining of sequential patterns in very large databases, 1997. Technical Report URCS TR 668, University of Rochester.

    Google Scholar 

  16. T. Zhang, R. Ramakrishnan, and M. Livny. Birch: A new data clustering algorithm and its applications. Data Mining and Knowledge Discovery, pages 141–182, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Kluwer Academic Publishers

About this chapter

Cite this chapter

Ma, S., Hellerstein, J.L. (2003). Mining Partially Periodic Patterns With Unknown Periods From Event Stream. In: Chen, D., Cheng, X. (eds) Pattern Recognition and String Matching. Combinatorial Optimization, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-0231-5_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-0231-5_15

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4613-7952-2

  • Online ISBN: 978-1-4613-0231-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics