TY - JOUR
T1 - Gap analysis business process model by using structural similarity
AU - Cahyapratama, Afrianda
AU - Sungkono, Kelly Rossa
AU - Sarno, Riyanarto
N1 - Publisher Copyright:
Copyright © 2020 Institute of Advanced Engineering and Science. All rights reserved.
PY - 2019
Y1 - 2019
N2 - Gap analysis process model is a study that can help an institution to determine differences between business process models, such as a model of Standard Operating Procedure and a model of activities in an event log. Gap analysis is used for finding incomplete processes and can be obtained by using structural similarity. Structural similarity measures the similarity of activities and relationships depicting in the models. This research introduces a graph-matching algorithm as the structural similarity algorithm and compares it with dice coefficient algorithms. Graph-matching algorithm notices parallel relationships and invisible tasks, on the contrary dice coefficient algorithms only measure closeness between activities and relationships. The evaluation shows that the graph-matching algorithm produces 76.76 percent similarity between an SOP model and a process model generating from an event log; while, dice coefficient algorithms produces 70 percent similarity. The ability in detecting parallel relationships and invisible tasks causes the graph-matching algorithm produces a higher similarity value than dice coefficient algorithms.
AB - Gap analysis process model is a study that can help an institution to determine differences between business process models, such as a model of Standard Operating Procedure and a model of activities in an event log. Gap analysis is used for finding incomplete processes and can be obtained by using structural similarity. Structural similarity measures the similarity of activities and relationships depicting in the models. This research introduces a graph-matching algorithm as the structural similarity algorithm and compares it with dice coefficient algorithms. Graph-matching algorithm notices parallel relationships and invisible tasks, on the contrary dice coefficient algorithms only measure closeness between activities and relationships. The evaluation shows that the graph-matching algorithm produces 76.76 percent similarity between an SOP model and a process model generating from an event log; while, dice coefficient algorithms produces 70 percent similarity. The ability in detecting parallel relationships and invisible tasks causes the graph-matching algorithm produces a higher similarity value than dice coefficient algorithms.
KW - Business process
KW - Dice coefficient similarity
KW - Gap analysis
KW - Graph database
KW - Graph-matching algorithm
UR - http://www.scopus.com/inward/record.url?scp=85075583719&partnerID=8YFLogxK
U2 - 10.11591/ijeecs.v18.i1.pp124-134
DO - 10.11591/ijeecs.v18.i1.pp124-134
M3 - Article
AN - SCOPUS:85075583719
SN - 2502-4752
VL - 18
SP - 124
EP - 134
JO - Indonesian Journal of Electrical Engineering and Computer Science
JF - Indonesian Journal of Electrical Engineering and Computer Science
IS - 1
ER -