Advertisement

Prefix and Suffix Sequential Pattern Mining

  • Rina Singh
  • Jeffrey A. Graves
  • Douglas A. Talbert
  • William Eberle
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10933)

Abstract

Sequential pattern mining is a challenging problem that has received much attention in the past few decades. The mining of large sequential databases can be very time consuming and produces a large number of unrelated patterns that must be evaluated. In this paper, we explore the problems of frequent prefix, prefix-closed, and prefix-maximal pattern mining along with their suffix variants. By constraining the pattern mining task, we are able to reduce the mining time required while obtaining patterns of interest. We introduce notations related to prefix/suffix sequential pattern mining while providing theorems and proofs that are key to our proposed algorithms. We show that the use of projected databases can greatly reduce the time required to mine the complete set of frequent prefix/suffix patterns, prefix/suffix-closed patterns, and prefix/suffix-maximal patterns. Theoretical analysis shows that our approach is better than the current existing approach, and empirical analysis on various datasets is used to support these conclusions.

References

  1. 1.
    Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering (1995)Google Scholar
  2. 2.
    Huang, C.L., Huang, W.L.: Handling sequential pattern decay: developing a two-stage collaborative recommender system. Electr. Commer. Res. Appl. 8, 117–129 (2009)CrossRefGoogle Scholar
  3. 3.
    Yap, G.-E., Li, X.-L., Yu, P.S.: Effective next-items recommendation via personalized sequential pattern mining. In: Lee, S., et al. (eds.) DASFAA 2012. LNCS, vol. 7239, pp. 48–64. Springer, Heidelberg (2012).  https://doi.org/10.1007/978-3-642-29035-0_4CrossRefGoogle Scholar
  4. 4.
    Baralis, E., et al.: Analysis of medical pathways by means of frequent closed sequences. In: Setchi, R., Jordanov, I., Howlett, R.J., Jain, L.C. (eds.) KES 2010. LNCS (LNAI), vol. 6278, pp. 418–425. Springer, Heidelberg (2010).  https://doi.org/10.1007/978-3-642-15393-8_47CrossRefGoogle Scholar
  5. 5.
    Uragaki, K., Hosaka, T., Arahori, Y., Kushima, M., Yamazaki, T., Araki, K., Yokota, H.: Sequential pattern mining on electronic medical records with handling time intervals and the efficacy of medicines. In: 2016 IEEE Symposium on Computers and Communication (ISCC) (2016)Google Scholar
  6. 6.
    Aloysius, G., Binu, D.: An approach to products placement in supermarkets using PrefixSpan algorithm. J. King Saud Univ.-Comput. Inf. Sci. 25, 77–87 (2013)Google Scholar
  7. 7.
    Shim, B., Choi, K., Suh, Y.: Crm strategies for a small-sized online shopping mall based on association rules and sequential patterns. Expert Syst. Appl. 39, 7736–7742 (2012)CrossRefGoogle Scholar
  8. 8.
    Chen, Y.L., Hu, Y.H.: Constraint-based sequential pattern mining: the consideration of recency and compactness. Decis. Support Syst. 42, 1203–1215 (2006)CrossRefGoogle Scholar
  9. 9.
    Antunes, C., Oliveira, A.L.: Generalization of pattern-growth methods for sequential pattern mining with gap constraints. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS, vol. 2734, pp. 239–251. Springer, Heidelberg (2003).  https://doi.org/10.1007/3-540-45065-3_21CrossRefzbMATHGoogle Scholar
  10. 10.
    Li, C., Wang, J.: Efficiently mining closed subsequences with gap constraints. In: Proceedings of the 2008 SIAM International Conference on Data Mining (2008)CrossRefGoogle Scholar
  11. 11.
    Srikant, R., Agrawal, R.: Mining sequential patterns: generalizations and performance improvements. In: Apers, P., Bouzeghoub, M., Gardarin, G. (eds.) EDBT 1996. LNCS, vol. 1057, pp. 1–17. Springer, Heidelberg (1996).  https://doi.org/10.1007/BFb0014140CrossRefGoogle Scholar
  12. 12.
    Kaytoue, M., Pitarch, Y., Plantevit, M., Robardet, C.: What effects topological changes in dynamic graphs? Elucidating relationships between vertex attributes and the graph structure. Soc. Netw. Anal. Min. 5, 55 (2015)CrossRefGoogle Scholar
  13. 13.
    Zaki, M.J.: SPADE: an efficient algorithm for mining frequent sequences. Mach. Learn. 42, 31–60 (2001)CrossRefGoogle Scholar
  14. 14.
    Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential pattern mining using a bitmap representation. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002)Google Scholar
  15. 15.
    Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: PrefixSpan: mining sequential patterns efficiently by prefix-projected pattern growth. In: Proceedings of the 17th International Conference on Data Engineering (2001)Google Scholar
  16. 16.
    Wang, J., Han, J.: BIDE: efficient mining of frequent closed sequences. In: Proceedings of the 20th International Conference on Data Engineering (2004)Google Scholar
  17. 17.
    Yan, X., Han, J., Afshar, R.: CloSpan: mining closed sequential patterns in large datasets. In: Proceedings of the 2003 SIAM International Conference on Data Mining (2003)CrossRefGoogle Scholar
  18. 18.
    Fournier-Viger, P., Lin, J.C.W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1, 54–77 (2017)Google Scholar
  19. 19.
    Fournier-Viger, P., et al.: The SPMF open-source data mining library version 2. In: Berendt, B., et al. (eds.) ECML PKDD 2016. LNCS (LNAI), vol. 9853, pp. 36–40. Springer, Cham (2016).  https://doi.org/10.1007/978-3-319-46131-1_8CrossRefGoogle Scholar
  20. 20.
    Chen, D., Sain, S.L., Guo, K.: Data mining for the online retail industry: a case study of RFM model-based customer segmentation using data mining. J. Database Mark. Customer Strategy Manag. 19, 197–208 (2012)CrossRefGoogle Scholar
  21. 21.
    Neidle, C.: SignStream™: a database tool for research on visual-gestural language. Sign Lang. Linguist. 4, 203–214 (2001)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Rina Singh
    • 1
  • Jeffrey A. Graves
    • 1
  • Douglas A. Talbert
    • 1
  • William Eberle
    • 1
  1. 1.Department of Computer ScienceTennessee Technological UniversityCookevilleUSA

Personalised recommendations