Graph Matching Algorithms for Business Process Model Similarity Search

  • Authors:
  • Remco Dijkman;Marlon Dumas;Luciano García-Bañuelos

  • Affiliations:
  • Eindhoven University of Technology, The Netherlands;University of Tartu, Estonia;University of Tartu, Estonia and Universidad Autonoma de Tlaxcala, Mexico

  • Venue:
  • BPM '09 Proceedings of the 7th International Conference on Business Process Management
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

We investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. We focus specifically on the application of graph matching algorithms to this similarity search problem. Since the corresponding graph matching problem is NP-complete, we seek to find a compromise between computational complexity and quality of the computed ranking. Using a repository of 100 process models, we evaluate four graph matching algorithms, ranging from a greedy one to a relatively exhaustive one. The results show that the mean average precision obtained by a fast greedy algorithm is close to that obtained with the most exhaustive algorithm.