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.
Cite
CITATION STYLE
Konchagin, A. M., & Kalenkova, A. A. (2018). On the efficient application of aho-corasick algorithm in process mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10716 LNCS, pp. 371–377). Springer Verlag. https://doi.org/10.1007/978-3-319-73013-4_34
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
