A Generic Approach for Process Performance Analysis Using Bipartite Graph Matching

1Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The field of process mining focuses on the analysis of event data, generated and captured during the execution of processes within companies. The majority of existing process mining techniques focuses on process discovery, i.e., automated (data-driven) discovery of a descriptive process model of the process, and conformance and/or compliance checking. However, to effectively improve processes, a detailed understanding in differences of the actual performance of a process, as well as the underlying causing factors, is needed. Surprisingly, few research focuses on generic techniques for process-aware data-driven performance measurement, analysis and prediction. Therefore, in this paper, we present a generic approach, which allows us to compute the average performance between arbitrary groups of activities active in a process. In particular, the technique requires no a priori knowledge of the process, and thus does not suffer from representational bias induced by any underlying process representation. Our experiments show that our approach is scalable to large cases and especially robust to recurrent activities in a case.

Cite

CITATION STYLE

APA

Li, C. Y., van Zelst, S. J., & van der Aalst, W. M. P. (2019). A Generic Approach for Process Performance Analysis Using Bipartite Graph Matching. In Lecture Notes in Business Information Processing (Vol. 362 LNBIP, pp. 199–211). Springer. https://doi.org/10.1007/978-3-030-37453-2_17

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