Sampling business process event logs using graph‐based ranking model

Abstract

Summary Modern information systems are continuously collecting and storing large volumes of business process event logs. The analysis of event logs can provide valuable insights for business process re‐engineering and enhancement. Process discovery, as one of the most challenging event log analysis techniques, aims to discover a business process model from an event log. Many process discovery approaches have been proposed in the past two decades, however, most of them suffer from efficiency problem when dealing with large‐scale event logs. Motivated by PageRank, we propose LogRank, a graph‐based ranking model, for event log sampling in this paper. The LogRank is capable of sampling a large‐scale event log to a smaller size that can be efficiently handled by existing discovery approaches. To support real‐life applications, we instantiate the LogRank model for two typical types of event logs, that is, simple event logs and lifecycle event logs. To quantify the quality of a sample log with respect to the original one, we introduce a general evaluation framework that can be instantiated for different quality metrics. The proposed sampling approach has been implemented in the open‐source process mining toolkit ProM. By experiments with both synthetic and real‐life event logs, we demonstrate that the proposed LogRank‐based sampling approach provides an effective means to improve process discovery efficiency as well as guaranteeing high quality of discovered models.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 31 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.