Journal article

Application of Genetic Algorithms for Finding Edit Distance between Process Models

Anna A Kalenkova, Danil A Kolesnikov

Modeling and Analysis of Information Systems | P.G. Demidov Yaroslavl State University


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 a..

View full abstract