An anti-noise process mining algorithm based on minimum spanning tree clustering

Weimin Li*, Heng Zhu, Wei Liu, Dehua Chen, Jiulei Jiang, Qun Jin


研究成果: Article査読

14 被引用数 (Scopus)


Many human-centric systems have begun to use business process management technology in production. With the operation of business process management systems, more and more business process logs and human-centric data have been accumulated. However, the effective utilization and analysis of these event logs are challenges that people need to solve urgently. Process mining technology is a branch of business process management technology. It can extract process knowledge from event logs and build process models, which helps to detect and improve business processes. The current process mining algorithms are inadequate in dealing with log noise. The family of alpha-algorithms ignores the impact of noise, which is unrealistic in real-life logs. Most of the process mining algorithms that can handle noise also lack reasonable denoising thresholds. In this paper, a new assumption on noise is given. Furthermore, an anti-noise process mining algorithm that can deal with noise is proposed. The decision rules of the selective, parallel, and non-free choice structures are also given. The proposed algorithm framework discovers the process model and transforms it into a Petri network representation. We calculate the distance between traces to build the minimum spanning tree on which clusters are generated. The traces of the non-largest clusters are treated as noise, and the largest cluster is mined. Finally, the algorithm can discover the regular routing structure and solve the problem of noise. The experimental results show the correctness of the algorithm when compared with the α ++ algorithm.

ジャーナルIEEE Access
出版ステータスPublished - 2018 8月 19

ASJC Scopus subject areas

  • 工学一般
  • 材料科学一般
  • コンピュータサイエンス一般


「An anti-noise process mining algorithm based on minimum spanning tree clustering」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。