Eindhoven University of Technology
The authors investigate the problem of ranking all process models in a repository according to their similarity with respect to a given process model. They focus specifically on the application of graph matching algorithms to this similarity search problem. Since the corresponding graph matching problem is NP-complete, they seek to find a compromise between computational complexity and quality of the computed ranking. Using a repository of 100 process models, they evaluate four graph matching algorithms, ranging from a greedy one to a relatively exhaustive one.