Log in

Mining sequential rules with itemset constraints

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Mining sequential rules from a sequence database usually returns a set of rules with great cardinality. However, in real world applications, the end-users are often interested in a subset of sequential rules. Particularly, they may consider only rules that contain a specific set of items. The naïve strategy is to apply such itemset constraints into the post-processing step. However, such approaches require much effort and time. This paper proposes the effective methods for integrating itemset constraints into the actual mining process. We proposed two algorithms, namely MSRIC-R and MSRIC-P, to solve this problem in which MSRIC-R pushed the constraints into the rule generating phase, and MSRIC-P pushes into the pattern mining phase. Experiments show that the proposed algorithms outperform the post-processing approach.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Lo D, Khoo SC, Wong L (2009) Non-redundant sequential rules—Theory and algorithm. Inf Syst 34(4):438–453

    Article  Google Scholar 

  2. Van TT, Vo B, Le B (2011) Mining Sequential Rules Based on Prefix-Tree. In: New Challenges for Intelligent Information and Database Systems. Stud Comput Intell 351:147–156

    Google Scholar 

  3. Spiliopoulou M (1999) September) Managing interesting rules in sequence mining. European Conference on Principles of Data Mining and Knowledge Discovery. Springer, Berlin, Heidelberg, pp 554–560

    Chapter  Google Scholar 

  4. Gouda K, Hassaan M, Zaki MJ (2010) Prism: An effective approach for frequent sequence mining via prime-block encoding. Comput Syst Sci 76(1):88–102

    Article  MathSciNet  Google Scholar 

  5. Agrawal R, Srikant R (1995) Mining sequential patterns. In: The 11th international conference on data engineering, 3–14

  6. Han J, Pei J, Mortazavi-Asl B, Chen Q, Dayal U, Hsu MC (2000) FreeSpan: frequent pattern-projected sequential pattern mining. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, 355–359

  7. Huynh B, Trinh C, Huynh H, Van TT, Vo B, Snasel V (2018) An efficient approach for mining sequential patterns using multiple threads on very large databases. Eng Appl Artif Intell 74:242–251

    Article  Google Scholar 

  8. Fournier-Viger P, Faghihi U, Nkambou R, Nguifo EM (2012) CMRules: An Efficient Algorithm for Mining Sequential Rules Common to Several Sequences. Knowl-Based Syst 25(1):63–76

    Article  Google Scholar 

  9. Yang J, Evans D, Bhardwaj D, Bhat T, Das M (2006) Perracotta: mining temporal API rules from imperfect traces. In Proceedings of the 28th international conference on Software engineering, 282-291

  10. Lo D, Khoo SC, Liu C (2008) Efficient mining of recurrent rules from a sequence database. In: International Conference on Database Systems for Advanced Applications, (67-83), Springer: Berlin

  11. Zhang M, Hsu W, Lee ML (2006) Mining progressive confident rules. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, 803–808

  12. Hsieh YL, Yang DL and Wu J (2006) Using data mining to study upstream and downstream causal relationship in stock market. In 9th Joint International Conference on Information Sciences (JCIS-06), 528–531, Atlantis Press

  13. Tran MT, Le B, Vo B, Hong TP (2016) Mining non-redundant sequential rules with dynamic bit vectors and pruning techniques. Appl Intell 45(2):333–342

    Article  Google Scholar 

  14. Srikant R, Agrawal R (1996) Mining sequential patterns: Generalizations and performance improvements. International conference on extending database technology. Springer, Berlin, Heidelberg, pp 1–17

    Google Scholar 

  15. Pei J, Han J, Mortazavi-Asl B, Wang J, Pinto H, Chen Q, Dayal U, Hsu MC (2004) Mining sequential patterns by pattern-growth: the prefixspan approach. IEEE Trans Knowl Data Eng 16(11):1424–1440

    Article  Google Scholar 

  16. Fournier-Viger P, Gomariz A, Campos M, Thomas R (2014) Fast vertical mining of sequential patterns using co-occurrence information. Pacific-Asia Conference on Knowledge Discovery and Data Mining. Springer, Cham, pp 40–52

    Chapter  Google Scholar 

  17. Tran MT, Le B, Vo B (2015) Combination of dynamic bit vectors and transaction information for mining frequent closed sequences efficiently. Eng Appl Artif Intell 38:183–189

    Article  Google Scholar 

  18. Pei J, Han J, Wang W (2007) Constraint-based sequential pattern mining: the pattern-growth methods. Intell Inf Syst 28(2):133–160

    Article  Google Scholar 

  19. Fournier-Viger P, Li J, Lin JCW, Chi TT, Kiran RU (2020) Mining cost-effective patterns in event logs. Knowl-Based Syst 191:105241

    Article  Google Scholar 

  20. Fournier-Viger P, Yang P, Lin JCW, & Yun U (2019) HUE-Span: fast high utility episode mining. In: International Conference on Advanced Data Mining and Applications, (pp. 169-184). Springer: Cham

  21. Rahman MM, Ahmed CF, Leung CKS (2020) Mining weighted frequent sequences in uncertain databases. Inf Sci 479:76–100

    Article  Google Scholar 

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

  23. Kiran RU, Anirudh A, Saideep C, Toyoda M, Reddy PK, Kitsuregawa M (2019) Finding periodic-frequent patterns in temporal databases using periodic summaries. Data Sci Pattern Recognit 3(2):24–46

    Google Scholar 

  24. Van T, Vo B, Le B (2018) Mining sequential patterns with itemset constraints. Knowl Inf Syst 57(2):311–330

    Article  Google Scholar 

  25. Fournier-Viger P, Wu CW, Tseng VS, Cao L, Nkambou R (2015) Mining partially-ordered sequential rules common to multiple sequences. IEEE Trans Knowl Data Eng 27(8):2203–2216

    Article  Google Scholar 

  26. Fournier-Viger P, Gueniche T, Zida S, & Tseng VS (2014) ERMiner: sequential rule mining using equivalence classes. In: International Symposium on Intelligent Data Analysis, (108-119), Springer: Cham

  27. Fahed L, Lenca P, Haralambous Y, Lefort R (2020) Distant event prediction based on sequential rules. Data Sci Pattern Recognit 4(1):1–23

    Google Scholar 

  28. Kohavi R, Brodley C, Frasca B, Mason L, Zheng Z (2000) KDD-Cup 2000 organizers’ report: peeling the onion. SIGKDD 2(2):86–98

    Article  Google Scholar 

Download references

Acknowledgements

This research is funded by University ofScience, VNU-HCM under grant number CNTT 2021 - 01.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bac Le.

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

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

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-020-02153-w

Keywords

Navigation