基于拟间接依赖的流程挖掘优化分析  

Optimization analysis of process mining based on quasi indirect dependence

作　　者：曹蕊 方贤文 王丽丽 CAO Rui;FANG Xianwen;WANG Lili(College of Mathematics and Big Data,Anhui University of Science and Technology,Huainan,Anhui 232001,China)

机构地区：[1]安徽理工大学数学与大数据学院,安徽淮南232001

出　　处：《计算机工程与应用》2018年第9期37-41,共5页Computer Engineering and Applications

基　　金：国家自然科学基金(No.61572035;No.61402011);安徽省自然科学基金(No.1508085MF111;No.1608085QF149);安徽省高校自然科学基金重点项目(No.KJ2016A208);安徽省学术和技术带头人资助项目(No.DG119);安徽省优秀青年人才项目(No.ZY290)

摘　　要：业务流程挖掘旨在从记录的事件日志中挖掘出满足人们需求的流程模型。以往的方法多是根据事件之间的直接依赖关系建立流程模型,具有一定的局限性,提出了基于拟间接依赖的流程挖掘优化分析方法。依据事件日志,以行为轮廓为基础,构建初始模型。在执行日志下,通过基于整数线性规划流程发现算法的基本约束体查找出具有拟间接依赖关系的变迁对,并对模型进行完善,挖掘出优化模型。通过具体的实例分析验证了该方法的有效性。Business process mining aims to dig out the process model to meet the needs of people from the event logs.Most of the previous methods are based on the direct dependencies between events to build process models.Previous methods have some limitations.This paper proposes a method of optimization analysis of process mining based on quasi indirect dependency.Firstly,according to the event log,the initial model is constructed on the basis of behavior profile.Then,this paper finds the transition pairs with quasi indirect dependency through the basic constraint body of the ILPbased process discovery algorithm based on example event log.The model is improved and the optimized model is mined.Finally,a concrete example analysis is given to illustrate the effectiveness of the proposed method.

关 键 词：PETRI网 行为轮廓 事件日志 过程挖掘 拟间接依赖关系 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]