使用语法推断的随机直接跟随流程发现
Stochastic Directly-Follows Process Discovery Using Grammatical Inference
AI总结:
针对仅有正例轨迹的流程发现问题,提出基于语法推断和遗传算法的随机直接跟随图发现方法,可生成更小且更准确表示轨迹频率的模型。
摘要:
从流程执行生成的轨迹集合出发,流程发现是构建描述该流程的简单模型的任务,其中简单性通常以模型规模来衡量。流程发现的挑战在于,目标流程是未知的,并且尽管输入轨迹构成了流程执行的正例,但没有负例可用。许多商业工具会发现直接跟随图,其中节点表示流程的可观察动作,有向弧表示动作之间执行顺序的可能性。我们提出了一种发现合理直接跟随图的新方法,其基础是对输入轨迹进行语法推断。为了促进发现既小又能准确描述流程的图,我们设计并评估了一种遗传算法,该算法支持推断参数收敛到能够发现有趣模型的区域。在真实数据集上的实验证实,与最先进技术相比,我们的新方法能够构建更小的模型,并且更准确地表示输入轨迹及其频率。由于我们提出的动作图具有随机语义,对编码轨迹的频率进行推理也成为可能;这些动作图首次被解释为描述动作轨迹随机语言的模型。
英文摘要:
Starting with a collection of traces generated by process executions, process discovery is the task of constructing a simple model that describes the process, where simplicity is often measured in terms of model size. The challenge of process discovery is that the process of interest is unknown, and that while the input traces constitute positive examples of process executions, no negative examples are available. Many commercial tools discover Directly-Follows Graphs, in which nodes represent the observable actions of the process, and directed arcs indicate execution order possibilities over the actions. We propose a new approach for discovering sound Directly-Follows Graphs that is grounded in grammatical inference over the input traces. To promote the discovery of small graphs that also describe the process accurately we design and evaluate a genetic algorithm that supports the convergence of the inference parameters to the areas that lead to the discovery of interesting models. Experiments over real-world datasets confirm that our new approach can construct smaller models that represent the input traces and their frequencies more accurately than the state-of-the-art technique. Reasoning over the frequencies of encoded traces also becomes possible, due to the stochastic semantics of the action graphs we propose, which, for the first time, are interpreted as models that describe the stochastic languages of action traces.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。