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

摘要： 隐变迁是指存在于事件日志中的不频繁行为，从流程模型中挖掘出隐变迁，提高流程运行效率和服务质量显得尤为重要。已有的方法大部分基于业务流程序列进行分析，但很少考虑跨序列间的关系，因此对挖掘业务流程隐变迁有一定的影响。提出流程树切挖掘业务流程隐变迁的方法，首先根据发生频数较高的日志序列得到初始模型，再根据流程树切预处理事件日志，把日志活动关系与初始模型关系进行对比，找到存在变化的区域，挖掘可能存在的隐变迁，通过评价指标判定带隐变迁的模型是最优模型，最后实例分析验证该方法的有效性。

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