Experimental verification and validation of the SICN-oriented process mining algorithm and system

被引:6
作者
Kim, Kyoung-Sook [1 ]
Pham, Dinh-Lam [1 ,3 ]
Park, Young-In [2 ]
Kim, Kwanghoon Pio [2 ]
机构
[1] Kyonggi Univ, Contents Convergence Software Res Inst, Suwon, South Korea
[2] Kyonggi Univ, Div Comp Sci & Engn, Data & Proc Engn Res Lab, 154-42 Kwangkyosan Ro, Suwon 16227, Gyeonggi Do, South Korea
[3] Vietnam Natl Univ Hanoi, Inst Informat Technol, Hanoi, Vietnam
基金
新加坡国家研究基金会;
关键词
Business process management; Structured information control nets (SICN); Process mining algorithm; Process rediscovery; Experimental verification and validation; BUSINESS PROCESS; PROCESS MODELS; FRAMEWORK; DISCOVERY; NETWORKS;
D O I
10.1016/j.jksuci.2021.12.013
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The purpose of this paper is to verify the functional correctness of a specific process mining algorithm and to validate the requirement satisfaction of the targeted algorithm, as well. The functional requirement of the process mining algorithm is to discover all the structural process patterns, such as linear (sequential), disjunctive (selective-OR), conjunctive (parallel-AND), and repetitive (iterative-LOOP) process patterns, from a dataset of process enactment event logs, and to eventually build a structured business process model by assembling all the discovered structural process patterns. The targeted algorithm to be verified and validated in this paper is called as q-Algorithm that is especially devised for discovering a structured information control net process model (SICN-oriented process model) from a dataset especially prepared in the standardized IEEE XES event stream format. In order to carry out the verification and validation, we have successfully developed a process mining system based upon the q-Algorithm, and through which four rounds of experiments are taken with four real datasets that are well fitted into the following situational mining and discovering scenarios: Faultlessness Process, Matched-Pairing Violation but Sound Process, Matched-Pairing and Proper-Nesting Violation but Sound Process, and Nebulous Process (Adaptive Cases). Conclusively, we strongly believe that the q-Algorithm is theoretically safe as well as functionally operable, and that the implemented q-Algorithm is also practically applicable to a process mining system as one of the business process and workflow intelligence solutions. (c) 2021 The Authors. Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页码:9793 / 9813
页数:21
相关论文
共 40 条
[1]  
Aalst W.V.D., LECT NOTES BUSINESS, V99
[2]   Domain-specific knowledge graphs: A survey [J].
Abu-Salih, Bilal .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2021, 185
[3]  
Agrawal R, 1998, LECT NOTES COMPUT SC, V1377, P469
[4]   Organizational Closeness Centralities of Workflow-Supported Performer-to-Activity Affiliation Networks [J].
Ahn, Hyun ;
Kim, Kwanghoon Pio .
IEEE ACCESS, 2021, 9 :48555-48582
[5]   Formal Approach to Workflow Application Fragmentations Over Cloud Deployment Models [J].
Ahn, Hyun ;
Kim, Kwanghoon Pio .
CMC-COMPUTERS MATERIALS & CONTINUA, 2021, 67 (03) :3071-3088
[6]   Formal approach for discovering work transference networks from workflow logs [J].
Ahn, Hyun ;
Kim, Kwanghoon Pio .
INFORMATION SCIENCES, 2020, 515 :1-25
[7]   An end-user approach to business process modeling [J].
Antunes, Pedro ;
Simoes, David ;
Carrico, Luis ;
Pino, Jose A. .
JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2013, 36 (06) :1466-1479
[8]  
Computer Science Lab, 2016, L GRAPHSTR A DYN GRA
[9]   Aligning Real Process Executions and Prescriptive Process Models through Automated Planning [J].
de Leoni, M. ;
Marrella, A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 82 :162-183
[10]   Discovering Redo-Activities and Performers' Involvements from XES- Formatted Workflow Process Enactment Event Logs [J].
Dinh-Lam Pham ;
Ahn, Hyun ;
Kim, Kwanghoon Pio .
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS, 2019, 13 (08) :4108-4122