Improving the performance of process discovery algorithms by instance selection

11Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Sani, M. F., van Zelst, S. J., & van der Aalst, W. (2020). Improving the performance of process discovery algorithms by instance selection. Computer Science and Information Systems, 17(3), 927–958. https://doi.org/10.2298/CSIS200127028S

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free