Skip to main content

Parallel Mining of Partial Periodic Itemsets in Big Data

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

Abstract

Partial Periodic itemsets are an important class of regularities that exist in a temporal database. A Partial Periodic itemset is something persistent and predictable that appears in the data. Past studies on Partial Periodic itemsets have been primarily focused on centralized databases and are not scalable for Big Data environments. One cannot ignore the advantage of scalability by using more resources. This is because we deal with large databases in a real-time environment and using more resources can increase the performance. To address the issue we have proposed a parallel algorithm by including the step of distributing transactional identifiers among the machines and mining the identical itemsets independently over the different machines. Experiments on Apache Spark’s distributed environment show that the proposed approach speeds up with the increase in a number of machines.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Apache Software Foundation. http://www.apache.org/

  2. Datasets. http://www.tkl.iis.u-tokyo.ac.jp/udayrage/datasets.php

  3. Hadoop. http://hadoop.apache.org

  4. Spark. http://spark.apache.org/

  5. Anirudh, A., Kiran, R.U., Reddy, P.K., Toyoda, M., Kitsuregawa, M.: An efficient map-reduce framework to mine periodic frequent patterns. In: Bellatreche, L., Chakravarthy, S. (eds.) Big Data Analytics and Knowledge Discovery, pp. 120–129. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64283-3_9

    Chapter  Google Scholar 

  6. 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 

  7. Berberidis, C., Vlahavas, I., Aref, W.G., Atallah, M., Elmagarmid, A.K.: On the discovery of weak periodicities in large time series. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS, vol. 2431, pp. 51–61. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45681-3_5

    Chapter  MATH  Google Scholar 

  8. 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). https://doi.org/10.1007/978-3-540-24775-3_77

    Chapter  Google Scholar 

  9. Han, J., Dong, G., Yin, Y.: Efficient mining of partial periodic patterns in time series database. In: International Conference on Data Engineering, pp. 106–115 (1999)

    Google Scholar 

  10. 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. LNCS, vol. 8422, pp. 377–391. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-05813-9_25

    Chapter  Google Scholar 

  11. Kiran, R.U., Shang, H., Toyoda, M., Kitsuregawa, M.: Discovering partial periodic itemsets in temporal databases. In: Proceedings of the 29th International Conference on Scientific and Statistical Database Management. SSDBM 2017, New York, NY, USA. Association for Computing Machinery (2017). https://doi.org/10.1145/3085504.3085535

  12. Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: PFP: parallel FP-growth for query recommendation. In: Proceedings of the 2008 ACM Conference on Recommender Systems, RecSys 2008, New York, NY, USA, pp. 107–114. Association for Computing Machinery (2008). https://doi.org/10.1145/1454008.1454027

  13. 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 (LNAI), vol. 5476, pp. 242–253. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-01307-2_24

    Chapter  Google Scholar 

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

    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

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Saideep, C. et al. (2020). Parallel Mining of Partial Periodic Itemsets in Big Data. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds) Trends in Artificial Intelligence Theory and Applications. Artificial Intelligence Practices. IEA/AIE 2020. Lecture Notes in Computer Science(), vol 12144. Springer, Cham. https://doi.org/10.1007/978-3-030-55789-8_69

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-55789-8_69

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-55788-1

  • Online ISBN: 978-3-030-55789-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics