Efficient Process Model Discovery Using Maximal Pattern Mining
Liesaputra, V., Yongchareon, S., & Chaisiri, S. (2015). Efficient Process Model Discovery Using Maximal Pattern Mining. In H. MotahariNezhad, J. Recker, & M. Weidlich (Eds.), Proceedings of 13th International Conference, BPM 2015, Innsbruck, Austria, August 31 -- September 3 (Vol. 9253, pp. 441–456). Springer International Publishing. http://doi.org/10.1007/978-3-319-23063-4_29
Permanent Research Commons link: https://hdl.handle.net/10289/10567
In recent years, process mining has become one of the most important and promising areas of research in the field of business process management as it helps businesses understand, analyze, and improve their business processes. In particular, several proposed techniques and algorithms have been proposed to discover and construct process models from workflow execution logs (i.e., event logs). With the existing techniques, mined models can be built based on analyzing the relationship between any two events seen in event logs. Being restricted by that, they can only handle special cases of routing constructs and often produce unsound models that do not cover all of the traces seen in the log. In this paper, we propose a novel technique for process discovery using Maximal Pattern Mining (MPM) where we construct patterns based on the whole sequence of events seen on the traces—ensuring the soundness of the mined models. Our MPM technique can handle loops (of any length), duplicate tasks, non-free choice constructs, and long distance dependencies. Our evaluation shows that it consistently achieves better precision, replay fitness and efficiency than the existing techniques.
Springer International Publishing
This is an author’s accepted version of an article published in BPM2015, LNCS 9253. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23063-4_29. © Springer International Publishing Switzerland 2016