Application of Genetic Algorithms for Finding Edit Distance between Process Models

• Main Authors: Anna A. Kalenkova, Danil A. Kolesnikov
• Format: Article
• Language: English
• Published: Yaroslavl State University 2018-12-01
• Series: Modelirovanie i Analiz Informacionnyh Sistem
• Subjects: minimal graph edit distance; process mining; bpmn (business process model and notation); genetic algorithm
• Online Access: https://www.mais-journal.ru/jour/article/view/768

Finding graph-edit distance (graph similarity) is an important task in many computer science areas, such as image analysis, machine learning, chemicalinformatics. Recently, with the development of process mining techniques, it became important to adapt and apply existing graph analysis methods to examine process models (annotated graphs) discovered from event data. In particular, finding graph-edit distance techniques can be used to reveal patterns (subprocesses), compare discovered process models. As it was shown experimentally and theoretically justified, exact methods for finding graph-edit distances between discovered process models (and graphs in general) are computationally expensive and can be applied to small models only. In this paper, we present and assess accuracy and performance characteristics of an inexact genetic algorithm applied to find distances between process models discovered from event logs. In particular, we find distances between BPMN (Business Process Model and Notation) models discovered from event logs by using different process discovery algorithms. We show that the genetic algorithm allows us to dramatically reduce the time of comparison and produces results which are close to the optimal solutions (minimal graph edit distances calculated by the exact search algorithm).