基于邻接矩阵的业务流程间距离计算方法  

Method for Calculating Distance Between Business Processes Based on Adjacency Matrix

作　　者：吴亚锋 谭文安[1,2] WU Yafeng;TAN Wenan(College of Computer Science and Technology,Nanjing University of Aeronautics and Astronautics,Nanjing 211106,China;School of Computer and Information Engineering,Shanghai Second Polytechnic University,Shanghai 201209,China)

机构地区：[1]南京航空航天大学计算机科学与技术学院,南京211106 [2]上海第二工业大学计算机与信息工程学院,上海201209

出　　处：《计算机工程》2018年第4期52-58,共7页Computer Engineering

基　　金：国家自然科学基金(61672022);中央高校基本科研业务费专项资金;南京航空航天大学研究生创新基地(实验室)开放基金(kfjj20161608);上海第二工业大学重点学科和研究生创新基金(XXKZD1604)

摘　　要：在业务流程管理中,多数流程间距离计算方法忽略了事件日志的重要作用,并且计算效率较低。为此,通过引入邻接矩阵提出一种新的业务流程间距离计算方法。提取保存在各类信息管理系统中的事件日志,将其转换为仅包含活动执行轨迹的简单事件日志。在此基础上,通过定义活动间的紧邻关系构造活动邻接矩阵,同时借鉴矩阵论中矩阵范数的定义,给出流程间距离的定义,并证明其满足距离度量特性。实验结果表明,该方法能够区分选择结构和并行结构并发现不可见任务,计算效率较高。In business processes,most methods for calculating the distance between business processes ignore the importance of event log.Aiming at this problem,this paper proposes a new method based on adjacency matrix.Firstly,it extracts the event log stored in the various information management system and converts them to simple event logs that contain only the execution traces of activities.Then,it defines the immediate relationship between activities and constructs the activity adjacency matrix based on the immediate relationship of activities.Finally,based on the definition of matrix norm,it defines the distance between business processes.At the same time,it proves that the defined distance between business processes satisfies the distance metric.Experimental results show that the proposed method can distinguish the selection structure and the parallel structure and find the invisible task.It also has higher computational efficiency.

关 键 词：流程间距离 业务流程管理 事件日志 邻接矩阵 矩阵范数 

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