Skip to main content

Mining Episode Rules from Event Sequences Under Non-overlapping Frequency

  • Conference paper
  • First Online:

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

Abstract

Frequent episode mining is a popular framework for retrieving useful information from an event sequence. Many algorithms have been proposed to mine frequent episodes and to derive episode rules from them with respect to a given frequency function and its properties such as the anti-monotony. However, the interpretation of these rules is often difficult as their occurrences are allowed to overlap. To address this issue, this paper studies the novel problem of mining episode rules using non-overlapping occurrences of frequent episodes. The proposed rules have the form \(\beta \Rightarrow \alpha \) where \(\alpha \) and \(\beta \) are frequent episodes and \(\beta \) is a prefix of \(\alpha \). This kind of rules is well adapted for prediction tasks where a phenomenon is predicted from some observed event(s). An efficient algorithm named NONEPI (NON overlapping EPIsode rule miner) is presented and experiments have been performed to compare its performance with state-of-the-art algorithms.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

References

  1. Achar, A., Ibrahim, A., Sastry, P.S.: Pattern-growth based frequent serial episode discovery. Data Knowl. Eng. 87, 91–108 (2013)

    Google Scholar 

  2. Ao, X., Luo, P., Wang, J., Zhuang, F., He, Q.: Mining precise-positioning episode rules from event sequences. IEEE Trans. Knowl. Data Eng. 30(3), 530–543 (2018)

    Article  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. (TIST) 10(4), 1–26 (2019)

    Google Scholar 

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

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

    Article  Google Scholar 

  6. Huisheng, Z., Wang, P., Wang, W., Shi, B.: Discovering frequent closed episodes from an event sequence. In: The 2012 International Joint Conference on Neural Networks (IJCNN), Brisbane, QLD (2012)

    Google Scholar 

  7. 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 7th IEEE Conference on Cybernetics and Intelligent Systems, pp. 213–217. IEEE (2004)

    Google Scholar 

  8. Laxman, S.: Discovering frequent episodes: fast algorithms, connections with HMMs and generalizations. Indian Institute of Science, Bangalore, PhD thesis (2006)

    Google Scholar 

  9. Laxman, S., Sastry, P.S., Unnikrishnan, K.P.: Discovering frequent episodes and learning hidden Markov models: a formal connection. IEEE Trans. Knowl. Data Eng. 17(11), 1505–1517 (2005)

    Article  Google Scholar 

  10. Laxman, S., Sastry, P.S., Unnikrishnan, K.P.: A fast algorithm for finding frequent episodes in event streams. In: Proceedings of 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 410–419. ACM, New York (2007)

    Google Scholar 

  11. Liao, G., Yang, X., Xie, S., Yu, P.S., Wan, C.: Two-phase mining for frequent closed episodes. In: Cui, B., Zhang, N., Xu, J., Lian, X., Liu, D. (eds.) WAIM 2016. LNCS, vol. 9658, pp. 55–66. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39937-9_5

    Chapter  Google Scholar 

  12. Mahesh, J., Karypis, G., Kumar, V.: A Universal formulation of sequential patterns. Technical report 99–021, University of Minnesota (1999)

    Google Scholar 

  13. Mannila, H., Toivonen, H., Verkamo, I.: Dicovery of frequent episodes in event sequences. Data Mining Knowl. Discov. 1(3), 259–289 (1997)

    Article  Google Scholar 

  14. Méger, N., Rigotti, C.: Constraint-based mining of episode rules and optimal window sizes. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 313–324. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-30116-5_30

    Chapter  Google Scholar 

  15. SPMF Homepage. http://www.philippe-fournier-viger.com/spmf/. Accessed 01 Dec 2020

  16. Su, M.-Y.: Discovery and prevention of attack episodes by frequent episodes mining and finite state machines. J. Netw. Comput. Appl. 2(33), 156–167 (2010)

    Google Scholar 

  17. Wan, L., Chen, L., Zhang, C.: Mining dependent frequent serial episodes from uncertain sequence data. In: Proceedings IEEE 13th International Conference on Data Mining, pp. 1211–1216. IEEE (2013)

    Google Scholar 

  18. Zhu, H., Chen, L., Li, J., Zhou, A., Wang, P., Wang, W.: A general depth-first-search based algorithm for frequent episode discovery. In: Proceedings 14th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, pp. 890–899 (2018)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Farid Nouioua .

Editor information

Editors and Affiliations

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

Ouarem, O., Nouioua, F., Fournier-Viger, P. (2021). Mining Episode Rules from Event Sequences Under Non-overlapping Frequency. In: Fujita, H., Selamat, A., Lin, J.CW., Ali, M. (eds) Advances and Trends in Artificial Intelligence. Artificial Intelligence Practices. IEA/AIE 2021. Lecture Notes in Computer Science(), vol 12798. Springer, Cham. https://doi.org/10.1007/978-3-030-79457-6_7

Download citation

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

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-79456-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics