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