Handling concept drifts with traditional process discovery algorithms
摘要
Event logs are data sets recording the executions (called cases) of a business process. Several process discovery algorithms have been defined to mine event logs and discover models of how activities of logged processes are being executed (activity traces). In the process discovery problems, the Pareto principle plays an important role. In fact, it is quite common that a large portion of log traces is held by a small fraction of top-frequent variants. Hence, accounting for the expected Pareto distribution of event logs, traditional process discovery algorithms are commonly used to discover process models by analyzing the prevalent trace behaviors. However, the Pareto principle is not always verified, especially in complex processes, where the majority of traces in the event log is often spanned on a high number of top-frequent trace-variants. In addition, traditional process discovery algorithms perform an offline analysis of event logs, assuming that logged processes remain in a steady state over time. But, the steady state is rarely the real-world case due to conceptual drifts. In this study, we use the traditional process discovery algorithms under the dynamic conditions of real-world processes. To this aim, we define two approaches, namely