A Parallelized Frequent Temporal Pattern Mining Algorithm on a Time Series Database | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Parallelized Frequent Temporal Pattern Mining Algorithm on a Time Series Database

  • Conference paper
  • First Online:
Intelligent Information and Database Systems (ACIIDS 2021)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12672))

Included in the following conference series:

  • 2038 Accesses

Abstract

For many years, time series data have been considered as one of the most popular significant data forms in our daily life. Time series exist in many application domains such as finance, medicine, geology, meteorology, and telecommunication. Among the time series mining tasks, frequent temporal pattern discovery is an interesting task because this task brings us a deep insight view of relationships between many objects and events through time. However, it is challenging when a combinatorial explosion occurs with many longer time series. It is more challenging if more informative patterns are required from a time series database. In this paper, we propose a parallel algorithm, called PTP, to cope with the frequent temporal pattern mining task. Our PTP is developed with multithreading on a frequent temporal pattern tree where each branch is processed in parallel. In addition, our PTP maintains the details of each frequent temporal pattern not only from its frequent occurrences in an individual time series but also from its frequent inter-time series associations. As a result, frequent temporal patterns discovered by PTP are more informative with explicit and exact temporal information, showing the relationships among the objects/events corresponding to the time series. Through the experimental results on real time series, PTP outperforms the brute force algorithm and the existing non-parallel algorithm in terms of both time and space. The found frequent temporal patterns can be further analyzed for other tasks such as prediction, classification, and clustering.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 11439
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 14299
Price includes VAT (Japan)
  • 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

Similar content being viewed by others

References

  1. Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of VLDB, pp. 487–499. Springer (1994)

    Google Scholar 

  2. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26, 832–843 (1983)

    Article  Google Scholar 

  3. Batal, I., Fradkin, D., Harrison, J., Mörchen, F., Hauskrecht, M.: Mining recent temporal patterns for event detection in multivariate time series data. In: Proceedings of KDD, pp. 280–288. ACM (2012)

    Google Scholar 

  4. Batyrshin, I., Sheremetov, L., Herrera-Avelar, R.: Perception based patterns in time series data mining. In: Batyrshin, I., Kacprzyk, J., Sheremetov, L., Zadeh, L.A. (eds.) Perception-based Data Mining and Decision Making in Economics and Finance. SCI, vol. 36, pp. 85–118. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-36247-0_3

    Chapter  MATH  Google Scholar 

  5. Djenouri, Y., Djenouri, D., Belhadi, A., Cano, A.: Exploiting GPU and cluster parallelism in single scan frequent itemset mining. Inf. Sci. 496, 363–377 (2019)

    Article  Google Scholar 

  6. Financial time series, http://finance.yahoo.com/, Historical Prices tab, 01/01/2020

  7. Gan, W., Lin, J.C.-W., Fournier-Viger, P., Chao, H.-C., Yu, P.S.: A survey of parallel sequential pattern mining. ACM Trans. Knowl. Discov. Data. 13(3), 25:1–25:34 (2019)

    Google Scholar 

  8. Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of SIGMOD, pp. 1–12. ACM (2000)

    Google Scholar 

  9. Huynh, B., Trinh, C., Dang, V., Vo, B.: A parallel method for mining frequent patterns with multiple minimum support thresholds. Int. J. Innov. Comput. Inf. Control 15(2), 479–488 (2019)

    Google Scholar 

  10. Huynh, V.Q.P., Küng, J.: FPO tree and DP3 algorithm for distributed parallel frequent itemsets mining. Expert Syst. Appl. 140, 1–13 (2020)

    Article  Google Scholar 

  11. Kim, B., Yi, G.: Location-based parallel sequential pattern mining algorithm. IEEE Access 7, 128651–128658 (2019)

    Article  Google Scholar 

  12. Le, B., Huynh, U., Dinh, D.-T.: A pure array structure and parallel strategy for high-utility sequential pattern mining. Expert Syst. Appl. 104, 107–120 (2018)

    Article  Google Scholar 

  13. Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.: PFP: parallel FP-Growth for query recommendation. In: Proceedings of the 2008 ACM Conference on Recommender Systems, pp. 107–114. ACM (2008)

    Google Scholar 

  14. Lin, J., Keogh, E., Lonardi, S., Patel, P.: Mining motifs in massive time series databases. In: Proceedings of ICDM, pp. 370–377. IEEE (2002)

    Google Scholar 

  15. Mörchen, F., Ultsch, A.: Efficient mining of understandable patterns from multivariate interval time series. Data Min. Knowl. Disc. 15, 181–215 (2007). https://doi.org/10.1007/s10618-007-0070-1

    Article  MathSciNet  Google Scholar 

  16. Vu, N.T., Chau, V.T.N.: Frequent temporal inter-object pattern mining in time series. In: Huynh, V., Denoeux, T., Tran, D., Le, A., Pham, S. (eds.) Knowledge and Systems Engineering. AISC, vol. 244, pp. 161–174. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-02741-8_15

    Chapter  Google Scholar 

  17. Nguyen, T.V., Vo, T.N.C.: An efficient tree-based frequent temporal inter-object pattern mining approach in time series databases. VNU J. Sci. Comput. Sci. Comput. Eng. 31(1), 1–21 (2015)

    Google Scholar 

  18. Özkural, E., Uçar, B., Aykanat, C.: Parallel frequent item set mining with selective item replication. IEEE Trans. Parallel Distrib. Syst. 22(10), 1632–1640 (2011)

    Article  Google Scholar 

  19. Tran, P.T.B., Chau, V.T.N., Anh, D.T.: Towards efficiently mining frequent interval-based sequential patterns in time series databases. In: Bikakis, A., Zheng, X. (eds.) MIWAI 2015. LNCS (LNAI), vol. 9426, pp. 125–136. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-26181-2_12

    Chapter  Google Scholar 

  20. Pradhan, G.N., Prabhakaran, B.: Association rule mining in multiple, multidimensional time series medical data. J. Healthc. Inform. Res. 1(1), 92–118 (2017). https://doi.org/10.1007/s41666-017-0001-x

    Article  Google Scholar 

  21. Qin, L.-X., Shi, Z.-Z.: Efficiently mining association rules from time series. Int. J. Inf. Technol. 2(4), 30–38 (2006)

    Google Scholar 

  22. Sarker, B.K., Mori, T., Hirata, T., Uehara, K.: Parallel algorithms for mining association rules in time series data. In: Guo, M., Yang, L.T. (eds.) ISPA 2003. LNCS, vol. 2745, pp. 273–284. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-37619-4_28

    Chapter  MATH  Google Scholar 

  23. Sarker, B.K., Uehara, K., Yang, L.T.: Exploiting efficient parallelism for mining rules in time series data. In: Yang, L.T., Rana, O.F., Di Martino, B., Dongarra, J. (eds.) HPCC 2005. LNCS, vol. 3726, pp. 845–855. Springer, Heidelberg (2005). https://doi.org/10.1007/11557654_95

    Chapter  Google Scholar 

  24. Srivastava, D.K., Roychoudhury, B., Samalia, H.V.: Fuzzy association rule mining for economic development indicators. Int. J. Intell. Enterp. 6(1), 3–18 (2019)

    Article  Google Scholar 

  25. Ting, J., Fu, T., Chung, F.: Mining of stock data: intra- and inter-stock pattern associative classification. In: Proceedings of ICDM, pp. 30–36. IEEE (2006)

    Google Scholar 

  26. Wan, Y., Lau, R.Y.K., Si, Y.-W.: Mining subsequent trend patterns from financial time series. Int. J. Wavelets Multiresolut. Inf. Process. 18(3), 1–38 (2020)

    Google Scholar 

  27. Xun, Y., Zhang, J., Qin, X.: FiDoop: parallel mining of frequent itemsets using MapReduce. IEEE Trans. Syst. Man Cybern. Syst. 46(3), 313–325 (2016)

    Article  Google Scholar 

  28. Yan, D., Qu, W., Guo, G., Wang, X.: PrefixFPM: a parallel framework for general-purpose frequent pattern mining. In: Proceedings of ICDE, pp. 1938–1941. IEEE (2020)

    Google Scholar 

  29. Ye, Y., Chiang, C.-C.: A parallel apriori algorithm for frequent itemsets mining. In: Proceedings of the 4th International Conference on Software Engineering Research, Management and Applications, pp. 87–93. IEEE (2006)

    Google Scholar 

  30. Yoon, J.P., Luo, Y., Nam, J.: A bitmap approach to trend clustering for prediction in time-series databases. In: Data Mining and Knowledge Discovery: Theory, Tools, and Technology II (2001)

    Google Scholar 

  31. Yu, X., Li, Q., Liu, J.: Scalable and parallel sequential pattern mining using spark. World Wide Web 22(1), 295–324 (2018). https://doi.org/10.1007/s11280-018-0566-1

    Article  Google Scholar 

  32. Zhuang, D.E.H., Li, G.C.L., Wong, A.K.C.: Discovery of temporal associations in multivariate time series. IEEE Trans. Knowl. Data Eng. 26(12), 2969–2982 (2014)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. HCMC University of Foreign Language and Information Technology, Ho Chi Minh City, Vietnam

    Nguyen Thanh Vu

  2. Ho Chi Minh City University of Technology, Vietnam National University–HCMC, Ho Chi Minh City, Vietnam

    Chau Vo

Authors
  1. Nguyen Thanh Vu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chau Vo
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Nguyen Thanh Vu or Chau Vo .

Editor information

Editors and Affiliations

  1. Wrocław University of Science and Technology, Wrocław, Poland

    Ngoc Thanh Nguyen

  2. King Mongkut's Institute of Technology Ladkrabang, Bangkok, Thailand

    Suphamit Chittayasothorn

  3. Nanyang Technological University, Singapore, Singapore

    Dusit Niyato

  4. Wrocław University of Science and Technology, Wrocław, Poland

    Bogdan Trawiński

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Vu, N.T., Vo, C. (2021). A Parallelized Frequent Temporal Pattern Mining Algorithm on a Time Series Database. In: Nguyen, N.T., Chittayasothorn, S., Niyato, D., Trawiński, B. (eds) Intelligent Information and Database Systems. ACIIDS 2021. Lecture Notes in Computer Science(), vol 12672. Springer, Cham. https://doi.org/10.1007/978-3-030-73280-6_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-73280-6_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-73279-0

  • Online ISBN: 978-3-030-73280-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics