期刊
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
卷 35, 期 11, 页码 11784-11800出版社
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2022.3232207
关键词
Task analysis; Semantics; Business; Supervised learning; Standards; Analytical models; Process control; Process discovery; declarative process models; binary classification task
As the need for understanding and formalizing business processes continues to grow, the research field of process discovery has become increasingly important. This study focuses on declarative processes and presents a less-popular view of process discovery as a binary supervised learning task. The proposed approach, NegDis, shows promising results in terms of both performance and solution quality when compared to other relevant works in this field.
As the need to understand and formalise business processes into a model has grown over the last years, the process discovery research field has gained more and more importance, developing two different classes of approaches to model representation: procedural and declarative. Orthogonally to this classification, the vast majority of works envisage the discovery task as a one-class supervised learning process guided by the traces that are recorded into an input log. In this work instead, we focus on declarative processes and embrace the less-popular view of process discovery as a binary supervised learning task, where the input log reports both examples of the normal system execution, and traces representing a stranger behaviour according to the domain semantics. We therefore deepen how the valuable information brought by both these two sets can be extracted and formalised into a model that is optimal according to user-defined goals. Our approach, namely NegDis, is evaluated w.r.t. other relevant works in this field, and shows promising results regarding both the performance and the quality of the obtained solution.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据