An intelligent graph edit distance-based approach for finding business process similarities
There are numerous application areas of computing similarity between process models. It includes finding similar models from a repository, controlling redundancy of process models, and finding corresponding activities between a pair of process models. The similarity between two process models is com...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Published: |
Tech Science Press
2021
|
Online Access: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85113444929&doi=10.32604%2fcmc.2021.017795&partnerID=40&md5=dd17af98e7a7f2b29cfeebfe65f2e231 http://eprints.utp.edu.my/29450/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | There are numerous application areas of computing similarity between process models. It includes finding similar models from a repository, controlling redundancy of process models, and finding corresponding activities between a pair of process models. The similarity between two process models is computed based on their similarity between labels, structures, and execution behaviors. Several attempts have been made to develop similarity techniques between activity labels, as well as their execution behavior. However, a notable problem with the process model similarity is that two process models can also be similar if there is a structural variation between them.However, neither a benchmark dataset exists for the structural similarity between process models nor there exist an effective technique to compute structural similarity. To that end, we have developed a large collection of process models in which structural changes are handcrafted while preserving the semantics of the models. Furthermore, we have used a machine learning-based approach to compute the similarity between a pair of process models having structural and label differences. Finally, we have evaluated the proposed approach using our generated collection of process models. © 2021 Tech Science Press. All rights reserved. |
---|