Skip to main content
SpringerLink
Log in

On the Efficient Application of Aho-Corasick Algorithm in Process Mining

  • Conference paper
  • First Online:
Analysis of Images, Social Networks and Texts (AIST 2017)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10716))

  • 2229 Accesses

Abstract

In this paper we present an approach for searching sub-traces in event logs, generated by information systems. Our technique is heavily based on the Aho-Corasick algorithm, and extends it with simultaneous search on several event log traces. The computational complexity of the proposed approach was estimated. Moreover, the approach was implemented and verified on real-life event logs. It was shown that it allows to reduce the search time for event logs with a high proportion of similar traces.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. van der Aalst, W.M.P.: Process Mining: Data Science in Action, 2nd edn. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-49851-4

    Book  Google Scholar 

  2. Jagadeesh Chandra Bose, R.P., van der Aalst, W.M.P.: Abstractions in process mining: a taxonomy of patterns. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 159–175. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-03848-8_12

    Chapter  Google Scholar 

  3. Liesaputra, V., Yongchareon, S., Chaisiri, S.: Efficient process model discovery using maximal pattern mining. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 441–456. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-23063-4_29

    Chapter  Google Scholar 

  4. van der Aalst, W.M.P., Kalenkova, A., Rubin, V., Verbeek, E.: Process discovery using localized events. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 287–308. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-19488-2_15

    Chapter  Google Scholar 

  5. Conforti, R., Dumas, M., García-Bañuelos, L., La Rosa, M.: Beyond tasks and gateways: discovering BPMN models with subprocesses, boundary events and activity markers. In: Sadiq, S., Soffer, P., Völzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 101–117. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10172-9_7

    Google Scholar 

  6. Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333–340 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  7. Karp, R.M., Rabin, M.O.: Efficient randomized pattern-matching algorithms. IBM J. Res. Dev. 31(2), 249–260 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  8. Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323–350 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgment

This work was supported by the Basic Research Program at the National Research University Higher School of Economics and funded by RFBR and Moscow city Government according to the Research project No 15-37-70008 “mol_a_mos”.

Author information

Authors and Affiliations

  1. National Research University Higher School of Economics, Moscow, Russia

    Andrey M. Konchagin & Anna A. Kalenkova

Authors
  1. Andrey M. Konchagin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anna A. Kalenkova
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anna A. Kalenkova .

Editor information

Editors and Affiliations

  1. Eindhoven University of Technology, Eindhoven, The Netherlands

    Wil M.P. van der Aalst

  2. National Research University Higher School of Economics, Moscow, Russia

    Dmitry I. Ignatov

  3. Krasovsky Institute of Mathematics and Mechanics, Ekaterinburg, Russia

    Michael Khachay

  4. National Research University Higher School of Economics, Moscow, Russia

    Sergei O. Kuznetsov

  5. Skolkovo Institute of Science and Technology, Moscow, Russia

    Victor Lempitsky

  6. National Research University Higher School of Economics, Moscow, Russia

    Irina A. Lomazova

  7. Moscow State University, Moscow, Russia

    Natalia Loukachevitch

  8. LORIA, Campus Scientifique, Vandœuvre lès Nancy, France

    Amedeo Napoli

  9. University of Hamburg, Hamburg, Germany

    Alexander Panchenko

  10. University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

  11. National Research University Higher School of Economics, Nizhny Novgorod, Russia

    Andrey V. Savchenko

  12. Indiana University, Bloomington, Indiana, USA

    Stanley Wasserman

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Konchagin, A.M., Kalenkova, A.A. (2018). On the Efficient Application of Aho-Corasick Algorithm in Process Mining. In: van der Aalst, W., et al. Analysis of Images, Social Networks and Texts. AIST 2017. Lecture Notes in Computer Science(), vol 10716. Springer, Cham. https://doi.org/10.1007/978-3-319-73013-4_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-73013-4_34

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-73012-7

  • Online ISBN: 978-3-319-73013-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation