Skip to main content

Finding Periodic Patterns in Big Data

  • Conference paper
  • First Online:
Big Data Analytics (BDA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9498))

Included in the following conference series:

Abstract

Periodic pattern mining is an important model in data mining. It typically involves discovering all patterns that are exhibiting either complete or partial cyclic repetitions in a dataset. The problem of finding these patterns has been widely studied in time series and (temporally ordered) transactional databases. This paper contains these studies along with their advantages and disadvantages. This paper also discusses the usefulness of periodic patterns with two real-world case studies. The first case study describes the useful information discovered by periodic patterns in an aviation dataset. The second case study describes the useful information discovered by periodic patterns pertaining to users’ browsing behavior in an eCommerce site.

The tutorial will start by describing the frequent pattern model and the importance of enhancing this model with respect to time dimension. Next, we discuss the basic model of finding periodic patterns in time series, describe its limitations, and the approaches suggested to address these limitations. We next discuss the basic model of finding periodic patterns in a transactional database, describe its limitations, and the approaches suggested to address them. Finally, we end this tutorial with the real-world case studies that demonstrate the usefulness of these 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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

References

  1. Özden, B., Ramaswamy, S., Silberschatz, A.: Cyclic association rules. In: ICDE, pp. 412–421 (1998)

    Google Scholar 

  2. Han, J., Gong, W., Yin, Y.: Mining segment-wise periodic patterns in time-related databases. In: KDD, pp. 214–218 (1998)

    Google Scholar 

  3. Zhang, M., Kao, B., Cheung, D.W., Yip, K.Y.: Mining periodic patterns with gap requirement from sequences. ACM Trans. Knowl. Discov. Data 1(2) (2007)

    Google Scholar 

  4. Stormer, H.: Improving e-commerce recommender systems by the identification of seasonal products. In: Twenty Second Conference on Artificial Intelligence, pp. 92–99 (2007)

    Google Scholar 

  5. Ma, S., Hellerstein, J.: Mining partially periodic event patterns with unknown periods. In: ICDE, pp. 205–214 (2001)

    Google Scholar 

  6. Kiran, R.U., Shang, M.T., Kitsuregawa, M.: Discovering recurring patterns in time series. In: EDBT (2015, to be appeared)

    Google Scholar 

  7. Yang, R., Wang, W., Yu, P.: Infominer+: mining partial periodic patterns with gap penalties. In: ICDM, pp. 725–728 (2002)

    Google Scholar 

  8. Chen, S.-S., Huang, T.C.-K., Lin, Z.-M.: New and efficient knowledge discovery of partial periodic patterns with multiple minimum supports. J. Syst. Softw. 84(10), 1638–1651 (2011)

    Article  Google Scholar 

  9. Berberidis, C., Vlahavas, I.P., Aref, W.G., Atallah, M.J., Elmagarmid, A.K.: On the discovery of weak periodicities in large time series. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS (LNAI), vol. 2431, pp. 51–61. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  10. Cao, H., Cheung, D.W., Mamoulis, N.: Discovering partial periodic patterns in discrete data sequences. In: Dai, H., Srikant, R., Zhang, C. (eds.) PAKDD 2004. LNCS (LNAI), vol. 3056, pp. 653–658. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  11. Yang, J., Wang, W., Yu, P.S.: Mining asynchronous periodic patterns in time series data. IEEE Trans. Knowl. Data Eng. 15(3), 613–628 (2003)

    Article  Google Scholar 

  12. Tanbeer, S.K., Ahmed, C.F., 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)

    Chapter  Google Scholar 

  13. Uday Kiran, R., Krishna Reddy, P.: Towards efficient mining of periodic-frequent patterns in transactional databases. In: Bringas, P.G., Hameurlain, A., Quirchmayr, G. (eds.) DEXA 2010, Part II. LNCS, vol. 6262, pp. 194–208. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  14. Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k periodic-frequent pattern from transactional databases without support threshold. In: Papasratorn, B., Chutimaskul, W., Porkaew, K., Vanijja, V. (eds.) IAIT 2009. CCIS, vol. 55, pp. 18–29. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Kiran, R.U., Reddy, P.K.: An alternative interestingness measure for mining periodic-frequent patterns. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011, Part I. LNCS, vol. 6587, pp. 183–192. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. Kiran, R.U., Kitsuregawa, M.: Novel techniques to reduce search space in periodic-frequent pattern mining. In: Bhowmick, S.S., Dyreson, C.E., Jensen, C.S., Lee, M.L., Muliantara, A., Thalheim, B. (eds.) DASFAA 2014, Part II. LNCS, vol. 8422, pp. 377–391. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  17. Aref, W.G., Elfeky, M.G., Elmagarmid, A.K.: Incremental, online, and merge mining of partial periodic patterns in time-series databases. IEEE TKDE 16(3), 332–342 (2004)

    Google Scholar 

  18. Agrawal, R., Imieliński, T., Swami, A.: Mining association rules between sets of items in large databases. In: SIGMOD, pp. 207–216 (1993)

    Google Scholar 

  19. Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: ICDE, pp. 106–115 (1999)

    Google Scholar 

  20. Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: KDD, pp. 337–341 (1999)

    Google Scholar 

  21. Surana, A., Kiran, R.U., Reddy, P.K.: An efficient approach to mine periodic-frequent patterns in transactional databases. In: Cao, L., Huang, J.Z., Bailey, J., Koh, Y.S., Luo, J. (eds.) PAKDD Workshops 2011. LNCS, vol. 7104, pp. 254–266. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  22. Kiran, R.U., Kitsuregawa, M.: Discovering quasi-periodic-frequent patterns in transactional databases. In: Bhatnagar, V., Srinivasa, S. (eds.) BDA 2013. LNCS, vol. 8302, pp. 97–115. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  23. Weblog dataset. http://web.archive.org/web/20070713202946rn_1/lisp.vse.cz/challenge/CURRENT/

  24. Faa accidents dataset. http://www.asias.faa.gov/pls/apex/f?p=100:1:0::NO

Download references

Acknowledgments

This work was supported by the Research and Development on Real World Big Data Integration and Analysis program of the Ministry of Education, Culture, Sports, Science, and Technology, JAPAN.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. Uday Kiran .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kiran, R.U., Kitsuregawa, M. (2015). Finding Periodic Patterns in Big Data. In: Kumar, N., Bhatnagar, V. (eds) Big Data Analytics. BDA 2015. Lecture Notes in Computer Science(), vol 9498. Springer, Cham. https://doi.org/10.1007/978-3-319-27057-9_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27057-9_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27056-2

  • Online ISBN: 978-3-319-27057-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics