Business process graph matching based on vectorial signatures Online publication date: Fri, 24-May-2019
by Farid Kacimi; Abdelkamel Tari; Hamamache Kheddouci
International Journal of Business Process Integration and Management (IJBPIM), Vol. 9, No. 2, 2019
Abstract: During the last decade, business processes have gained in popularity leading to a rapid proliferation of business process model collections. The need for efficient and fast systems for similarity search or matching of process models from these collections is becoming an important issue with the increasing of the number of models. Graph-based approaches are very efficient for measuring the similarity of process models. However, they suffer from high complexity that grows exponentially with the size of the graphs. In this paper, we propose an approach for comparing and evaluating the similarity of process models based on vectorial signatures, taking into account the loops which may occur in the process. To reduce the complexity of matching, we split the process graphs into paths, then calculate their similarity based on the similarity of the different vectorial signatures of their paths. Experimental evaluations show the good performance of the proposed approach using several measures.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Process Integration and Management (IJBPIM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook