Applying MapReduce to Conformance Checking

• الحاوية / القاعدة: Труды Института системного программирования РАН
• المؤلفون الرئيسيون: I. S. Shugurov, A. A. Mitsyuk
• التنسيق: مقال
• اللغة: الإنجليزية
• منشور في: Russian Academy of Sciences, Ivannikov Institute for System Programming 2018-10-01
• الموضوعات: process mining; conformance checking; mapreduce; hadoop; big data
• الوصول للمادة أونلاين: https://ispranproceedings.elpub.ru/jour/article/view/112

Process mining is a relatively new research field, offering methods of business processes analysis and improvement, which are based on studying their execution history (event logs). Conformance checking is one of the main sub-fields of process mining. Conformance checking algorithms are aimed to assess how well a given process model, typically represented by a Petri net, and a corresponding event log fit each other. Alignment-based conformance checking is the most advanced and frequently used type of such algorithms. This paper deals with the problem of high computational complexity of the alignment-based conformance checking algorithm. Currently, alignment-based conformance checking is quite inefficient in terms of memory consumption and time required for computations. Solving this particular problem is of high importance for checking conformance between real-life business process models and event logs, which might be quite problematic using existing approaches. MapReduce is a popular model of parallel computing which allows for simple implementation of efficient and scalable distributed calculations. In this paper, a MapReduce version of the alignment-based conformance checking algorithm is described and evaluated. We show that conformance checking can be distributed using MapReduce and can benefit from it. Moreover, it is demonstrated that computation time scales linearly with the growth of event log size.