关键词: 流程树切, 隐变迁, 过程挖掘, Petri网

Abstract: The hide transition is a non-frequent behavior existing in the event log. It is very important to find the methods of mining the hide transitions from business processes, to improve process efficiency and the quality of service. Most of the existing methods for business process mining are based on the analysis of business process sequence, rarely consider the inter-relationship between sequences, thus there are certain impacts on the mining business process hide transitions. In this paper, the method to find hide transitions of business process is proposed based on the process tree cut. Firstly, the source model is obtained according to the higher frequency of occurrence log sequence. Then preprocessing log by the process tree cut, comparing the log relationship with the relationship of the initial model, and finding changes region, mining the possible hide transitions. Determining the optimal model with hide transitions through the evaluation criteria. Finally, the analysis of instance is used to verify the effectiveness of the method.

Key words: process tree cut, hide transition, process mining, Petri net