一种从无“aba”模式的日志中挖掘2度循环的方法  

Approach to Mining Length-Two Loops From the Log Without “aba” Pattern

作　　者：林雷蕾 周华 代飞 朱锐[1,2] 李彤[1,2] LIN Lei-Lei;ZHOU Hua;DAI Fei;ZHU Rui;LI Tong(School of Software,Yunnan University,Kunming 650091,China;School of Big Data and Intelligence Engineering,Southwest Forestry University,Kunming 650224,China;Key Laboratory for Software Engineering of Yunnan Province,Yunnan University,Kunming 650091,China)

机构地区：[1]云南大学软件学院,云南昆明650091 [2]云南省软件工程重点实验室(云南大学),云南昆明650091 [3]西南林业大学大数据与智能工程学院,云南昆明650224

出　　处：《软件学报》2018年第11期3278-3294,共17页Journal of Software

基　　金：国家自然科学基金(61462095;61702442;61662085);云南省自然科学基金(2016FB102);云南省中青年学术和技术带头人后备人才培养项目(C6143002);云南省软件工程重点实验室开放基金(2017SE201;2016SE202);云南省教育厅科学研究基金(2017YJS107;2017ZZX227);云南大学研究生创新项目(YDY17095)~~

摘　　要：现有的过程挖掘算法依赖于"aba"模式来挖掘2度循环,而满足局部完备性的日志文件中不一定出现该模式.为此,扩展了经典Alpha算法,提出了α^(L+)算法,用于从没有"aba"模式的日志文件中挖掘出2度循环.首先建立任务间的次序向量矩阵,用于抽象2度循环结构的变体结构;然后从全局视角,根据事件的出现次数及位置来区分2度循环和并发关系;最后提出紧邻度和回路抽象,以排除并发分支上同类型循环带来的干扰.实验结果表明,与现有的挖掘算法相比,α^(L+)算法能够从具有"aba"模式或不具有"aba"模式的日志文件中挖掘出2度循环.此外,该算法实现且集成在开源框架ProM中.The current research in mining length-two loops depends on ＂aba＂ pattern. However, the pattern does not necessarily appear in the logs that satisfies local completeness. This research aims at finding ways to mine length-two loops without the pattern. It results in a new algorithm（αL＋-algorithm） that is based on the α-algorithm. First, an order vector matrix is established by tasks in logs to abstract variant structures of length-two loops. Then, distinction between loops and concurrency structure is obtained by event＇s frequency and location in traces. Finally, proximity and circuit abstraction are used to eliminate the interference caused by the concurrent branches. The experimental results show that the αL＋-algorithm can handle length-two loops with or without ＂aba＂ pattern. In addition, the αL＋-algorithm is implemented in the ProM tool.

关 键 词：日志抽象 向量矩阵 过程挖掘 局部完备性 PETRI网 

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