Skip to main content

Towards Efficient Discovery of Stable Periodic Patterns in Big Columnar Temporal Databases

  • Conference paper
  • First Online:
Advances and Trends in Artificial Intelligence. Theory and Practices in Artificial Intelligence (IEA/AIE 2022)

Abstract

Extracting stable periodic-frequent patterns in very large temporal databases is a key task in big data analytics. Existing studies have mainly concentrated on discovering these patterns only in row temporal databases, and completely ignored the existence of these patterns in columnar databases, which are widely becoming popular for storing big data. In this paper we propose an efficient algorithm, Stable Periodic-frequent Pattern-Equivalence CLass Transformation (SPP-ECLAT), to find the desired patterns in a columnar temporal database. Empirical results demonstrate that the SPP-ECLAT algorithm is much faster and consumes significantly less memory than the state-of-the-art SPP-growth algorithm on sparse and dense databases.

H. N. Dao, P. Ravikumar, P. Likitha and B. V. V. Raj—These authors equally contributed to 98% of this paper.

Y. Watanobe and I. Paik—These authors have equally contributed to 2% of this paper.

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.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

Notes

  1. 1.

    Row and columnar databases are also referred to as horizontal and vertical databases, respectively.

  2. 2.

    ACID stands for Atomicity, Consistency, Isolation, and Duration.

  3. 3.

    BASE stands for Basically Available, Soft state, and Eventually consistent.

References

  1. Kiran, R.U., et al.: Discovering fuzzy periodic-frequent patterns in quantitative temporal databases. In: 2020 (FUZZ-IEEE), pp. 1–8 (2020)

    Google Scholar 

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

    Google Scholar 

  3. Fournier-Viger, P., Lin, J.C., Duong, Q., Dam, T.: PHM: mining periodic high-utility itemsets. In: ICDM, pp. 64–79 (2016)

    Google Scholar 

  4. Kiran, R.U., Venkatesh, J.N., Fournier-Viger, P., Toyoda, M., Reddy, P.K., Kitsuregawa, M.: Discovering periodic patterns in non-uniform temporal databases. In: PAKDD (2017)

    Google Scholar 

  5. Fournier-Viger, P., Yang, P., Lin, J.C., Kiran, R.U.: Discovering stable periodic-frequent patterns in transactional data. In: IEA/AIE, pp. 230–244 (2019)

    Google Scholar 

  6. Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering periodic-frequent patterns in transactional databases. In: PAKDD, pp. 242–253 (2009)

    Google Scholar 

  7. Amphawan, K., Lenca, P., Surarerks, A.: Mining top-k periodic-frequent pattern from transactional databases without support threshold. In: Advances in Information Technology, pp. 18–29 (2009)

    Google Scholar 

  8. Kiran, R.U., Kitsuregawa, M.: Novel techniques to reduce search space in periodic-frequent pattern mining. In: DASFAA, pp. 377–391 (2014)

    Google Scholar 

  9. Anirudh, A., Kiran, R.U., Reddy, P.K., Kitsuregawa, M.: Memory efficient mining of periodic-frequent patterns in transactional databases. In: IEEE Symposium Series on Computational Intelligence 2016, pp. 1–8 (2016)

    Google Scholar 

  10. Penugonda, R., Palla, L., Rage, U.K., Watanobe, Y., Zettsu, K.: Towards efficient discovery of periodic-frequent patterns in columnar temporal databases. In: IEA/AIE. Springer International Publishing 2021, pp. 28–40 (2021)

    Google Scholar 

  11. Kiran, R.U., Shang, H., Toyoda, M., Kitsuregawa, M.: Discovering partial periodic itemsets in temporal databases. In: SSDBM, pp. 30:1–30:6 (2017)

    Google Scholar 

  12. He, R., Chen, J., Du, C., Duan, Y.: Stable periodic frequent itemset mining on uncertain datasets. In. IEEE CCET 2021, pp. 263–267 (2021)

    Google Scholar 

  13. Fournier Viger, P., Wang, Y., Yang, P., Lin, C.-W., Yun, U., Rage, U.: Tspin: mining top-k stable periodic patterns. Applied Intelligence, 02 2021

    Google Scholar 

Download references

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

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dao, H.N. et al. (2022). Towards Efficient Discovery of Stable Periodic Patterns in Big Columnar Temporal Databases. In: Fujita, H., Fournier-Viger, P., Ali, M., Wang, Y. (eds) Advances and Trends in Artificial Intelligence. Theory and Practices in Artificial Intelligence. IEA/AIE 2022. Lecture Notes in Computer Science(), vol 13343. Springer, Cham. https://doi.org/10.1007/978-3-031-08530-7_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-08530-7_70

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-08529-1

  • Online ISBN: 978-3-031-08530-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics