Skip to main content

Discovering Process-Based Drivers for Case-Level Outcome Explanation

  • Conference paper
  • First Online:
Process Mining Workshops (ICPM 2023)

Part of the book series: Lecture Notes in Business Information Processing ((LNBIP,volume 503))

Included in the following conference series:

  • 59 Accesses

Abstract

Process mining has shown great impact in improving business Key Performance Indicators (KPIs), which are typically measured as aggregations over case-level outcomes. A commonly encountered key question in achieving such impact is understanding the underlying reasons for why a certain outcome appears in some cases (e.g., why certain cases take long to finish). We use the term drivers to refer to explanations for case-level outcomes. We hypothesize that how process is run, in other words, process traces, directly influences case-level outcomes, and hence KPIs. In this paper, we propose a new method to automatically and efficiently discover process-based drivers that are effective, significant and interpretable. We formally define the problem of driver discovery as a constrained optimization problem. Given that the problem is NP-hard, we develop efficient greedy algorithms to solve the problem. We evaluate our method on real-world datasets to demonstrate the effectiveness and efficiency of our approach.

H. Zhang—Equal contribution, work done in Celonis.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

References

  1. Agrawal, R., Srikant, R., et al.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487–499. Santiago, Chile (1994)

    Google Scholar 

  2. Altmann, A., Toloşi, L., Sander, O., Lengauer, T.: Permutation importance: a corrected feature importance measure. Bioinformatics 26(10), 1340–1347 (2010)

    Article  Google Scholar 

  3. Badakhshan, P., Wurm, B., Grisold, T., Geyer-Klingeberg, J., Mendling, J., vom Brocke, J.: Creating business value with process mining. J. Strateg. Inf. Syst. 31(4) (2022)

    Google Scholar 

  4. Breiman, L.: Random forests. Mach. Learn. 45, 5–32 (2001)

    Article  Google Scholar 

  5. Chung, Y., Kraska, T., Polyzotis, N., Tae, K.H., Whang, S.E.: Slice finder: automated data slicing for model validation. In: IEEE 35th International Conference on Data Engineering (ICDE), pp. 1550–1553. IEEE (2019)

    Google Scholar 

  6. Cox, D.R.: The regression analysis of binary sequences. J. R. Stat. Soc.: Ser. B (Methodol.) 20(2), 215–232 (1958)

    MathSciNet  Google Scholar 

  7. van Dongen, B.: Bpi challenge 2017 (2017). https://doi.org/10.4121/uuid:5f3067df-f10b-45da-b98b-86ae4c7a310b

  8. van Dongen, B.: Bpi challenge 2019 (2019). https://doi.org/10.4121/uuid:d06aff4b-79f0-45e6-8ec8-e19730c248f1

  9. van Dongen, B., Borchert, F.F.: Bpi challenge 2018 (2018). https://doi.org/10.4121/uuid:3301445f-95e8-4ff0-98a4-901f1f204972

  10. Hooker, S., Erhan, D., Kindermans, P.J., Kim, B.: Evaluating Feature Importance Estimates (2018). arXiv https://arxiv.org/pdf/1806.10758.pdf

  11. Hossin, M., Sulaiman, M.N.: A review on evaluation metrics for data classification evaluations. Int. J. Data Min. Knowl. Manag. Process 5(2), 1 (2015)

    Article  Google Scholar 

  12. Kumar, A., Vembu, S., Menon, A.K., Elkan, C.: Beam search algorithms for multilabel learning. Mach. Learn. 92, 65–89 (2013)

    Article  MathSciNet  Google Scholar 

  13. de Leoni, M., van der Aalst, W.M.P.: Data-aware process mining: discovering decisions in processes using alignments. In: Proceedings of the 28th Annual ACM Symposium on Applied Computing, pp. 1454–1461. SAC ’13, Association for Computing Machinery, New York, NY, USA (2013)

    Google Scholar 

  14. de Leoni, M., Dumas, M., García-Bañuelos, L.: Discovering branching conditions from business process execution logs. In: Cortellessa, V., Varró, D. (eds.) FASE 2013. LNCS, vol. 7793, pp. 114–129. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-37057-1_9

    Chapter  Google Scholar 

  15. Lewis, R.J.: An introduction to classification and regression tree (CART) analysis. In: Annual Meeting of the Society for Academic Emergency Medicine in San Francisco, California, vol. 14. Citeseer (2000)

    Google Scholar 

  16. Mannhardt, F., de Leoni, M., Reijers, H.A., van der Aalst, W.M.P.: Decision mining revisited - discovering overlapping rules. In: Nurcan, S., Soffer, P., Bajec, M., Eder, J. (eds.) CAiSE 2016. LNCS, vol. 9694, pp. 377–392. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39696-5_23

    Chapter  Google Scholar 

  17. Padella, A., de Leoni, M., Dogan, O., Galanti, R.: Explainable process prescriptive analytics. In: 2022 4th International Conference on Process Mining (ICPM). IEEE (oct 2022)

    Google Scholar 

  18. Rozinat, A., van der Aalst, W.M.P.: Decision mining in ProM. In: Dustdar, S., Fiadeiro, J.L., Sheth, A.P. (eds.) BPM 2006. LNCS, vol. 4102, pp. 420–425. Springer, Heidelberg (2006). https://doi.org/10.1007/11841760_33

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xu Chu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, P., Zhang, H., Chu, X., Seeliger, A., Yu, C. (2024). Discovering Process-Based Drivers for Case-Level Outcome Explanation. In: De Smedt, J., Soffer, P. (eds) Process Mining Workshops. ICPM 2023. Lecture Notes in Business Information Processing, vol 503. Springer, Cham. https://doi.org/10.1007/978-3-031-56107-8_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-56107-8_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-56106-1

  • Online ISBN: 978-3-031-56107-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics