Skip to main content
SpringerLink
Log in

Discovering periodic cluster patterns in event sequence databases

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Since periodic events are very common everywhere, periodic pattern mining is increasingly more important in today’s data mining domain. However, there is currently no uniform definition of periodic patterns, and all of these definitions are incapable of discovering seasonally prevalent events. In this paper, we first define the periodic event based on the coefficient of variation of the event’s periods in event sequence. Then, in order to discover seasonally prevalent events, we propose a new concept of periodic cluster patterns and design an efficient algorithm named the PCPM(Periodic Cluster Pattern Miner) to mine periodic cluster patterns in event sequence datasets. To illustrate the application of periodic cluster patterns, we propose a new method employed periodic cluster pattern prediction for next basket recommendation, and the method is named PCPP(Periodic Cluster Pattern Predictor). Experiments show that the PCPM is effective for periodic cluster pattern mining and that PCPP has performances close to those of the baseline methods on four real-world transaction datasets. Furthermore, we believe that periodic cluster patterns, as a new concept, will have a wider application in other domains, such as time series prediction, meteorological forecasting, etc.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. The source code of our PCPM algorithm is provided at https://github.com/gshchen-10/PCPM

  2. https://www.kaggle.com/chiranjivdas09/ta-feng-grocery-dataset

  3. Provided by Guidotti et al.[35] at https://github.com/riccotti/CustomerTemporalRegularities/tree/master/datasets

  4. https://www.kaggle.com/mvyurchenko/x5-retail-hero

  5. https://github.com/riccotti/CustomerTemporalRegularities/tree/master/datasets

  6. https://github.com/HaojiHu/TIFUKNN

  7. https://github.com/MayloIFERR/RACF

  8. https://github.com/GiulioRossetti/tbp-next-basket

References

  1. Zhang R, Huang Y, Pu M, Zhang J, Ling H (2020) Object discovery from a single unlabeled image by mining frequent itemsets with multi-scale features. IEEE Transactions on Image Processing. PP(99) 1–1

  2. Soleimani G, Abessi M (2020) DLCSS: A new similarity measure for time series data mining. Eng Appl Artif Intell 92:103664

    Article  Google Scholar 

  3. Zhou H, Hirasawa K (2019) Evolving temporal association rules in recommender system. Neural Comput & Applic 2019(31):2605–2619

    Article  Google Scholar 

  4. Mabu AM, Prasad R, Yadav R, Jauro SS (2018) A Review of Data Mining Methods in Bioinformatics. 2018 Recent Advances on Engineering, Technology and Computational Sciences (RAETCS)

  5. Agrawal R, Imieliński T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Rec 22(2):207–216

    Article  Google Scholar 

  6. Islam MA, Rafi MR, Azad AA, Ovi JA (2021) Weighted frequent sequential pattern mining. Appl Intell. https://doi.org/10.1007/s10489-021-02290-w

  7. Van T, Le B (2021) Mining sequential rules with itemset constraints. Appl Intell. https://doi.org/10.1007/s10489-020-02153-w

  8. Kiran RU, Venkatesh JN, Toyoda M, Kitsuregawa M, Reddy PK (2017) Discovering partial periodic-frequent patterns in a transactional database. J Syst Softw 125(Mar.):170–182

    Article  Google Scholar 

  9. Sethi KK, Ramesh D (2020) High average-utility itemset mining with multiple minimum utility threshold: a generalized approach. Eng Appl Artif Intell 96:103933

    Article  Google Scholar 

  10. Nguyen L, Vo B, Le NT, Snasel V, Zelinka I (2020) Fast and scalable algorithms for mining subgraphs in a single large graph. Eng Appl Artif Intell 90(Apr.):103539.1–103539.12

    Google Scholar 

  11. Kanaan M, Cazabet R, Kheddouci H (2020) Temporal Pattern Mining for Ecommerce Dataset. In: Transactions on large-scale data- and knowledge-centered systems XLVI, Springer Berlin Heidelberg, Berlin, Heidelberg, 2020, pp. 67–90. https://doi.org/10.1007/978-3-662-62386-2_3

  12. Chanda AK, Saha S, Nishi MA, Samiullah M, Ahmed CF (2015) An efficient approach to mine flexible periodic patterns in time series databases. Eng Appl Artif Intell. (2015) 44:46–63

    Article  Google Scholar 

  13. Yuan Q, Shang J, Cao X, Zhang C, Geng X, Han J (2017) Detecting multiple periods and periodic patterns in event time sequences. CIKM 2017:617–626

    Google Scholar 

  14. Kostrzewa J (2015) Time series forecasting using clustering with periodic pattern. IJCCI (NCTA) 2015:85–92

    Google Scholar 

  15. Tanbeer SK, Ahmed CF, Jeong B, Lee Y (2009) Discovering Periodic-Frequent patterns in transactional databases. PAKDD 2009:242–253

    Google Scholar 

  16. Fournier-Viger P, Lin CW, Duong QH, Dam TL, Voznak M (2016) PFPM: Discovering periodic frequent patterns with novel periodicity measures. In: Proceedings of the 2nd Czech-China scientific conference, 2016, 2017

  17. Rana S, Mondal MNI (2021) An approach for seasonally periodic frequent pattern mining in retail supermarket. SSRN Electronic Journal 2021;(1)

  18. Li Z, Wang J, Han J (2015) ePeriodicity:, Mining event periodicity from incomplete observations. TKDE (2015) 27(5):1219– 1232

    Google Scholar 

  19. Ester M, Kriegel H, Sander J, Xu X (1996) A Density-Based algorithm for discovering clusters in large spatial databases with noise. KDD 1996:226–231

    Google Scholar 

  20. Cumby CM, Fano AE, Ghani R, Krema M (2004) Predicting customer shopping lists from point-of-sale purchase data. In: Proceedings of the Tenth ACM SIGKDD international conference on knowledge discovery and data mining, pp 402–409. https://doi.org/10.1145/1014052.1014098

  21. Yang KJ, Hong TP, Chen YM, Lan GC (2013) Projection-based partial periodic pattern mining for event sequences. Expert Syst Appl 40(10):4232–4240

    Article  Google Scholar 

  22. Amphawan K, Lenca P, Surarerks A (2009) Mining Top-K Periodic-Frequent pattern from transactional databases without support threshold. IAIT, pp 18–29

  23. Kiran RU, Reddy PK (2011) An alternative interestingness measure for mining Periodic-Frequent patterns. DASFAA 1:183–192

    Google Scholar 

  24. Rashid MM, Karim MR, Jeong BS, Choi HJ (2012) Efficient mining regularly frequent patterns in transactional databases. DASFAA 1:258–271

    Google Scholar 

  25. Kiran RU, Kitsuregawa M, Reddy PK (2016) Efficient discovery of periodic-frequent patterns in very large databases. J Syst Softw 112:110–121

    Article  Google Scholar 

  26. Fournier-Viger P, Li Z, Lin JC, Kiran RU, Fujita H (2019) Efficient algorithms to identify periodic patterns in multiple sequences. Inf Sci 489:205–226. https://doi.org/10.1016/j.ins.2019.03.050

    Article  MathSciNet  Google Scholar 

  27. Fournier-Viger P, Yang P, Kiran RU, Ventura S, Luna JM (2021) Mining local periodic patterns in a discrete sequence. Inf Sci 544:519–548

    Article  MathSciNet  Google Scholar 

  28. Fournier-Viger P, Wang Y, Yang P, Lin CW, Kiran RU (2021) TSPIN: mining top-k stable periodic patterns. Applied Intelligence(439)

  29. Nofong VM (2018) Fast and memory efficient mining of periodic frequent patterns, vol 2018

  30. Ma S, Hellerstein JL (2001) Mining partially periodic event patterns with unknown periods. ICDE, pp 205–214

  31. Akther S, Karim MR, Samiullah M, Ahmed CF (2018) Mining non-redundant closed flexible periodic patterns. Eng Appl Artif Intell 69:1–23

    Article  Google Scholar 

  32. Kiran RU, Saideep C, Zettsu K, Toyoda M, Kitsuregawa M, Reddy PK (2019) Discovering partial periodic spatial patterns in spatiotemporal databases. IEEE BigData, pp 233–238

  33. Afriyie MK, Nofong VM, Wondoh J, Abdel-Fatao H (2020) Mining Non-redundant Periodic Frequent Patterns. ACIIDS 1:321–331

    Google Scholar 

  34. Huang JW, Jaysawal BP, Wang CC (2021) Mining full, inner and tail periodic patterns with perfect, imperfect and asynchronous periodicity simultaneously. Data Min Knowl Disc 35:1225–1257. https://doi.org/10.1007/s10618-021-00753-9

    Article  MathSciNet  Google Scholar 

  35. Guidotti R, Gabrielli L, Monreale A, Pedreschi D, Giannotti F (2018) Discovering temporal regularities in retail customers’ shopping behavior. Epj Data Science 7(1):6

    Article  Google Scholar 

  36. Guidotti R, Rossetti G, Pappalardo L, Giannotti F, Pedreschi D (2019) Personalized market basket prediction with temporal annotated recurring sequences. IEEE Trans Knowl Data Eng 31(11):2151–2163. https://doi.org/10.1109/TKDE.2018.2872587

    Article  Google Scholar 

  37. Lee DD, Seung HS (2000) Algorithms for non-negative matrix factorization. In: Advances in neural information processing systems 13, papers from neural information processing systems (NIPS), vol 2000, pp 556–562

  38. Wang P, Guo J, Lan Y, Xu J, Wan S, Cheng X (2015) Learning hierarchical representation model for next basket recommendation. In: Proceedings of the 38th international ACM SIGIR conference on research and development in information retrieval, pp 403–412. https://doi.org/10.1145/2766462.2767694

  39. Hu HJ, He XN, Gao JY, Zhang ZL (2020) Modeling Personalized Item Frequency Information for Next-basket Recommendation. SIGIR 2020:1071–1080

    Article  Google Scholar 

  40. Faggioli G, Polato M, Aiolli F (2020) Recency aware collaborative filtering for next basket recommendation. In: UMAP’20, July. https://doi.org/10.1145/3340631.3394850, vol 14-17. Genoa, Italy, pp 80–87

Download references

Acknowledgements

We truly thank the reviewers for valuable and suggestion comments. This work was supported in part by the National Natural Science Foundation of China under Grant 61672261 and Grant 61802056, and in part by the Industrial Technology Research and Development Project of Jilin Development and Reform Commission under Grant 2019C053-9.

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Jilin University, Changchun, 130012, China

    Guisheng Chen & Zhanshan Li

  2. Key Laboratory of Symbolic Computation and Knowledge Engineering, Ministry of Education (Jilin University), Changchun, 130012, China

    Guisheng Chen & Zhanshan Li

Authors
  1. Guisheng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhanshan Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhanshan Li.

Ethics declarations

Conflict of Interests

We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chen, G., Li, Z. Discovering periodic cluster patterns in event sequence databases. Appl Intell 52, 15387–15404 (2022). https://doi.org/10.1007/s10489-022-03186-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-022-03186-z

Keywords

Search

Navigation