Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2010, Vol. 36 ›› Issue (12): 88-89. doi: 10.3969/j.issn.1000-3428.2010.12.031

• Networks and Communications • Previous Articles     Next Articles

Mining Algorithm for Incontiguous Pattern of Workflow

ZHOU Yan-jun1, CHE Jin-hui1,2, WANG Xiao-dong1   

  1. (1. School of Computer Science and Information Technology, Northeast Normal University, Changchun 130117;2. Computer College, Beihua University, Jilin 132021)
  • Online:2010-06-20 Published:2010-06-20

工作流的非邻接模式挖掘算法

周颜军1,车进辉1,2,王晓东1   

  1. (1. 东北师范大学计算机科学与信息技术学院,长春 130117;2. 北华大学计算机科学技术学院,吉林 132021)
  • 作者简介:周颜军(1956-),男,副教授,主研方向:数据挖掘; 车进辉,讲师、硕士;王晓东,硕士

Abstract:

In order to discover latent knowledge existing in the operation process of business process, this paper proposes a mining algorithm of incontiguous pattern. This algorithm mines incontiguous patterns by graph analyzing method in which workflow model and enactment log are used. It improves the efficiency by fully pruning the search space of candidate patterns and can provide reference for rebuilding and optimization of business process.

Key words: workflow, frequent incontiguous pattern, graph mining

摘要:

为了发现业务执行流程中的潜在知识,提出一种非邻接模式挖掘算法,同时考虑活动和边的发生频率,结合工作流模型和作用日志,以图分析方法挖掘工作流非邻连模式。该算法对候选模式搜索空间进行充分剪枝,以提高运行效率,可以为业务流程的改造和优化提供依据。

关键词: 工作流, 频繁非邻接模式, 图挖掘

CLC Number: