Improving the performance of process discovery algorithms by instance selection
Computer Science and Information Systems, vol. 17, pp. 927–958
Abstract
Process discovery algorithms automatically discover process models based on event data that is captured during the execution of business processes. These algorithms tend to use all of the event data to discover a process model. When dealing with large event logs, it is no longer feasible using standard hardware in limited time. A straightforward approach to overcome this problem is to down-size the event data by means of sampling. However, little research has been conducted on selecting the right sample, given the available time and characteristics of event data. This paper evaluates various subset selection methods and evaluates their performance on real event data. The proposed methods have been implemented in both the ProM and the RapidProM platforms. Our experiments show that it is possible to considerably speed up discovery using instance selection strategies. Furthermore, results show that applying biased selection of the process instances compared to random sampling will result in simpler process models with higher quality.
Authors 3
-
Affiliation as printed
Process and Data Science Chair, RWTH Aachen University, Aachen, Germany
-
RWTH Aachen University · Fraunhofer Institute for Applied Information Technology
Affiliation as printed
Process and Data Science Chair, RWTH Aachen University, Aachen, Germany + Fraunhofer FIT, Birlinghoven Castle, Sankt Augustin, Germany
Fraunhofer FIT, Birlinghoven Castle, Sankt Augustin, Germany
-
RWTH Aachen University · Fraunhofer Institute for Applied Information Technology
Affiliation as printed
Process and Data Science Chair, RWTH Aachen University, Aachen, Germany + Fraunhofer FIT, Birlinghoven Castle, Sankt Augustin, Germany
Fraunhofer FIT, Birlinghoven Castle, Sankt Augustin, Germany
Cited by 17 stored of 17
17 results
No patents citing this paper on Lens.org (checked 2026-10-06).