计算机科学 ›› 2012, Vol. 39 ›› Issue (11): 153-156.

• 数据库与数据挖掘 • 上一篇    下一篇

一种新的工作流频繁闭合模式挖掘算法研究

王丹丹 蒋文娟   

  1. (南通大学计算机科学与技术学院 南通 226019)
  • 出版日期:2018-11-16 发布日期:2018-11-16

New Algorithm for Mining Workflow Frequent Closet Pattern

  • Online:2018-11-16 Published:2018-11-16

摘要: 为了提高工作流环境下频繁模式挖掘的准确性,提出了一种新的频繁闭合模式挖掘算法。首先扩展了依赖 矩阵的定义,即利用工作流日志建立包含直接依赖关系和交叠关系的依赖支持度矩阵。然后扩展了CHARM算法, 以在支持度矩阵的基础上自动挖掘频繁闭合活动集。最后对频繁闭合项集进行处理,以形成最终的工作流频繁闭合 模式。该算法对于并行和选择关系的处理能力优于同类算法。

关键词: 工作流,频繁闭合模式,依赖矩阵

Abstract: To improve the accuracy of workflow frequent patterns, we proposed a new algorithm for mining frequent closed pattern. First, we extended the definition of the dependence Matrix, which includes direct dependency and over- lapping relationship among activities from the work flow logs. Second, we extended the CHARM algorithm to mine all closed frequent patterns over the dependence matrix Finally, the workflow frequent patterns were generated by discar- ding non-frequent patterns. The algorithm has advantages in dealing with the interleaving relations among activities and workflow models with both serial or parallel relations.

Key words: Workflow,Closcd frequent patterns,Dcpendcnce matrix

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!