基于关系矩阵的工作流日志重复任务识别算法  

Detecting duplicate tasks from workflow logs based on casual matrix

作　　者：潘建梁 俞东进[1] 陈耀旺 PAN Jianliang, YU Dongjin, CHEN Yaowang(School of Computing, Hangzhou Dianzi University, Hangzhou 310018, Chin)

机构地区：[1]杭州电子科技大学计算机学院,浙江杭州310018

出　　处：《计算机集成制造系统》2018年第7期1784-1792,共9页Computer Integrated Manufacturing Systems

基　　金：国家自然科学基金资助项目(61472112);浙江省重点研发资助项目(2017C01010;2016F50014;2015C01040)~~

摘　　要：针对传统工作流模型挖掘算法不考虑模型中重复任务的存在,导致挖掘出的模型精确度不高的问题,提出一种基于关系矩阵的重复任务识别方法。通过分析工作流执行日志得到所有事件的前驱后继关系,根据不同的模型结构进行事件重命名,再基于同类别重复事件之间的相似度对重复事件进行聚类得到最优识别结果。实验表明,该方法能正确有效地识别工作流日志中的重复任务,减少模型中的不可见任务,最终提高工作流模型挖掘方法的精确度和可理解性。Aiming at the problem that the traditional process mining algorithms neglected the existence of duplicate tasks in workflow model, which led to the poor precision while using workflow logs produced by these models, a Split and Cluster （SaC） algorithm to detect duplicate tasks from workflow logs based on casual matrix was proposed. The algorithm obtained the casual matrix by analyzing the predecessors and successors of each event in workflow log, the events were relabeled according to specific model structure, and then the optimal result was obtained by clustering the repeating events based on the similarity of each duplicate event. Experimental results showed that SaC could detect duplicate tasks in log correctly and efficiently and reduce the invisible tasks, thus improved the precision and comprehensibility of workflow models.

关 键 词：工作流日志 工作流模型挖掘 重复任务 关系矩阵 任务聚类 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]