Skip to main content

MaxFEM: Mining Maximal Frequent Episodes in Complex Event Sequences

  • Conference paper
  • First Online:
Multi-disciplinary Trends in Artificial Intelligence (MIWAI 2022)

Abstract

For the analysis of discrete sequences, frequent episode mining (FEM) is a key technique. The goal is to enumerate all subsequences of symbols or events that are appearing at least some minimum number of times. In the last decades, several efficient episode mining algorithms were designed. Nonetheless, a major issue is that they often yield a huge number of frequent episodes, which is inconvenient for users. As a solution, this paper presents an efficient algorithm called MaxFEM (Maximal Frequent Episode Miner) to identify only the maximal frequent episodes of a complex sequence. A major benefit is to reduce the set of frequent episodes presented to the user. MaxFEM includes many strategies to improve its performance. The evaluation of MaxFEM on real datasets confirms that it has excellent performance.

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 54.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.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. Amiri, M., Mohammad-Khanli, L., Mirandola, R.: An online learning model based on episode mining for workload prediction in cloud. Futur. Gener. Comput. Syst. 87, 83–101 (2018)

    Article  Google Scholar 

  2. Ao, X., Luo, P., Li, C., Zhuang, F., He, Q.: Online frequent episode mining. In: Proceedings of the 31st IEEE International Conference on Data Engineering, pp. 891–902 (2015)

    Google Scholar 

  3. Ao, X., Shi, H., Wang, J., Zuo, L., Li, H., He, Q.: Large-scale frequent episode mining from complex event sequences with hierarchies. ACM Trans. Intell. Syst. Technol. 10(4), 1–26 (2019)

    Article  Google Scholar 

  4. 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_8

    Chapter  Google Scholar 

  5. Fournier-Viger, P., Lin, J.C.W., Kiran, U.R., Koh, Y.S.: A survey of sequential pattern mining. Data Sci. Pattern Recogn. 1(1), 54–77 (2017)

    Google Scholar 

  6. Fournier-Viger, P., Yang, P., Lin, J.C.-W., Yun, U.: HUE-Span: fast high utility episode mining. In: Li, J., Wang, S., Qin, S., Li, X., Wang, S. (eds.) ADMA 2019. LNCS (LNAI), vol. 11888, pp. 169–184. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-35231-8_12

    Chapter  Google Scholar 

  7. Fournier-Viger, P., Yang, Y., Yang, P., Lin, J.C.-W., Yun, U.: TKE: mining top-k frequent episodes. In: Fujita, H., Fournier-Viger, P., Ali, M., Sasaki, J. (eds.) IEA/AIE 2020. LNCS (LNAI), vol. 12144, pp. 832–845. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-55789-8_71

    Chapter  Google Scholar 

  8. Huang, K., Chang, C.: Efficient mining of frequent episodes from complex sequences. Inf. Syst. 33(1), 96–114 (2008)

    Article  Google Scholar 

  9. Iwanuma, K., Takano, Y., Nabeshima, H.: On anti-monotone frequency measures for extracting sequential patterns from a single very-long data sequence. In: Proceedings of the IEEE Conference on Cybernetics and Intelligent Systems, vol. 1, pp. 213–217 (2004)

    Google Scholar 

  10. Li, L., Li, X., Lu, Z., Lloret, J., Song, H.: Sequential behavior pattern discovery with frequent episode mining and wireless sensor network. IEEE Commun. Mag. 55(6), 205–211 (2017)

    Article  Google Scholar 

  11. Liao, G., Yang, X., Xie, S., Yu, P.S., Wan, C.: Mining weighted frequent closed episodes over multiple sequences. Tehnički vjesnik 25(2), 510–518 (2018)

    Google Scholar 

  12. Lin, Y., Huang, C., Tseng, V.S.: A novel methodology for stock investment using high utility episode mining and genetic algorithm. Appl. Soft Comput. 59, 303–315 (2017)

    Article  Google Scholar 

  13. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episodes in sequences. In: Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining (1995)

    Google Scholar 

  14. Nawaz, M.S., Fournier-Viger, P., Shojaee, A., Fujita, H.: Using artificial intelligence techniques for COVID-19 genome analysis. Appl. Intell. 51(5), 3086–3103 (2021). https://doi.org/10.1007/s10489-021-02193-w

    Article  Google Scholar 

  15. Nawaz, M.S., Sun, M., Fournier-Viger, P.: Proof guidance in PVS with sequential pattern mining. In: Hojjat, H., Massink, M. (eds.) FSEN 2019. LNCS, vol. 11761, pp. 45–60. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-31517-7_4

    Chapter  Google Scholar 

  16. Su, M.Y.: Applying episode mining and pruning to identify malicious online attacks. Comput. Electr. Eng. 59, 180–188 (2017)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to M. Saqib Nawaz .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Fournier-Viger, P., Nawaz, M.S., He, Y., Wu, Y., Nouioua, F., Yun, U. (2022). MaxFEM: Mining Maximal Frequent Episodes in Complex Event Sequences. In: Surinta, O., Kam Fung Yuen, K. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2022. Lecture Notes in Computer Science(), vol 13651. Springer, Cham. https://doi.org/10.1007/978-3-031-20992-5_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-20992-5_8

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-20991-8

  • Online ISBN: 978-3-031-20992-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics