IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v303y2022i3p1304-1320.html
   My bibliography  Save this article

Continuous discovery of Causal nets for non-stationary business processes using the Online Miner

Author

Listed:
  • Potoniec, Jedrzej
  • Sroka, Daniel
  • Pawlak, Tomasz P.

Abstract

Capturing business process specifics using a model is essential to effectively manage, control, and instruct the process participants with their roles and tasks. A normative process model is an invaluable source of information, not only for human inspection but also for software supporting and controlling the process. The actual process execution likely deviates from the normative model and the magnitude of deviation usually increases over time due to process evolution. A descriptive process model is far more informative when comes to the analysis of the actual execution of the process and spotting the deviations from the norm. However, handcrafting the descriptive model using process-related documents is prohibitively laborious. To automate the discovery of the descriptive process models, we propose Online Miner (OM), an algorithm that continuously builds process models using a stream of events raised by the process. OM first builds a sound process model using a historical event log and then incrementally adapts this model to new data chunks. OM represents the model using a Causal-net – a dependency graph of activities in which arcs are bound with each other to reflect parallel dependencies and exclusive alternatives. OM finds the maximal bindings being consistent with the event log. OM produces sound and perfect fit and generalizing well models. OM quickly reacts to the concept drift spot in the event log by seamlessly adapting the model. OM helps business analytics experts with their everyday tasks of monitoring, auditing, and enhancing business processes.

Suggested Citation

  • Potoniec, Jedrzej & Sroka, Daniel & Pawlak, Tomasz P., 2022. "Continuous discovery of Causal nets for non-stationary business processes using the Online Miner," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1304-1320.
    • Handle: RePEc:eee:ejores:v:303:y:2022:i:3:p:1304-1320
    DOI: 10.1016/j.ejor.2022.03.046
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221722002685
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2022.03.046?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Pawlak, Tomasz P. & Litwiniuk, Bartosz, 2021. "Ellipsoidal one-class constraint acquisition for quadratically constrained programming," European Journal of Operational Research, Elsevier, vol. 293(1), pages 36-49.
    2. Pawlak, Tomasz P. & Krawiec, Krzysztof, 2017. "Automatic synthesis of constraints from examples using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 261(3), pages 1141-1157.
    3. William Day & Herbert Edelsbrunner, 1984. "Efficient algorithms for agglomerative hierarchical clustering methods," Journal of Classification, Springer;The Classification Society, vol. 1(1), pages 7-24, December.
    4. Zerbino, Pierluigi & Stefanini, Alessandro & Aloini, Davide, 2021. "Process Science in Action: A Literature Review on Process Mining in Business Management," Technological Forecasting and Social Change, Elsevier, vol. 172(C).
    5. Pavlos Delias & Vassilios Zoumpoulidis & Ioannis Kazanidis, 2019. "Visualizing and exploring event databases: a methodology to benefit from process analytics," Operational Research, Springer, vol. 19(4), pages 887-908, December.
    6. Hämäläinen, Raimo P. & Lahtinen, Tuomas J., 2016. "Path dependence in Operational Research—How the modeling process can influence the results," Operations Research Perspectives, Elsevier, vol. 3(C), pages 14-20.
    7. Gert Janssenswillen & Benoît Depaire & Sabine Verboven, 2018. "Detecting train reroutings with process mining," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 7(1), pages 1-24, March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Fajemisin, Adejuyigbe O. & Maragno, Donato & den Hertog, Dick, 2024. "Optimization with constraint learning: A framework and survey," European Journal of Operational Research, Elsevier, vol. 314(1), pages 1-14.
    2. Claudiu Vinte & Marcel Ausloos, 2022. "The Cross-Sectional Intrinsic Entropy. A Comprehensive Stock Market Volatility Estimator," Papers 2205.00104, arXiv.org.
    3. Wu, Yongjiao & Dong, Suocheng & Huang, Haosheng & Zhai, Jun & Li, Yu & Huang, Dingxuan, 2018. "Quantifying urban land expansion dynamics through improved land management institution model: Application in Ningxia-Inner Mongolia, China," Land Use Policy, Elsevier, vol. 78(C), pages 386-396.
    4. Sondoss Elsawah & Elena Bakhanova & Raimo P. Hämäläinen & Alexey Voinov, 2023. "A Competency Framework for Participatory Modeling," Group Decision and Negotiation, Springer, vol. 32(3), pages 569-601, June.
    5. Elena Bakhanova & Jaime A. Garcia & William L. Raffe & Alexey Voinov, 2023. "Gamification Framework for Participatory Modeling: A Proposal," Group Decision and Negotiation, Springer, vol. 32(5), pages 1167-1182, October.
    6. Lerato Lerato & Thomas Niesler, 2015. "Clustering Acoustic Segments Using Multi-Stage Agglomerative Hierarchical Clustering," PLOS ONE, Public Library of Science, vol. 10(10), pages 1-24, October.
    7. William Day & Herbert Edelsbrunner, 1985. "Investigation of proportional link linkage clustering methods," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 239-254, December.
    8. Monika Khandelwal & Sabha Sheikh & Ranjeet Kumar Rout & Saiyed Umer & Saurav Mallik & Zhongming Zhao, 2022. "Unsupervised Learning for Feature Representation Using Spatial Distribution of Amino Acids in Aldehyde Dehydrogenase (ALDH2) Protein Sequences," Mathematics, MDPI, vol. 10(13), pages 1-20, June.
    9. Linnéusson, Gary & Ng, Amos H.C. & Aslam, Tehseen, 2020. "A hybrid simulation-based optimization framework supporting strategic maintenance development to improve production performance," European Journal of Operational Research, Elsevier, vol. 281(2), pages 402-414.
    10. Alberto Fernández & Sergio Gómez, 2020. "Versatile Linkage: a Family of Space-Conserving Strategies for Agglomerative Hierarchical Clustering," Journal of Classification, Springer;The Classification Society, vol. 37(3), pages 584-597, October.
    11. Pawlak, Tomasz P. & Litwiniuk, Bartosz, 2021. "Ellipsoidal one-class constraint acquisition for quadratically constrained programming," European Journal of Operational Research, Elsevier, vol. 293(1), pages 36-49.
    12. Hewitt, Mike & Frejinger, Emma, 2020. "Data-driven optimization model customization," European Journal of Operational Research, Elsevier, vol. 287(2), pages 438-451.
    13. C. Finden & A. Gordon, 1985. "Obtaining common pruned trees," Journal of Classification, Springer;The Classification Society, vol. 2(1), pages 255-276, December.
    14. Maria-Isabel Sanchez-Segura & Roxana González-Cruz & Fuensanta Medina-Dominguez & German-Lenin Dugarte-Peña, 2022. "Valuable Business Knowledge Asset Discovery by Processing Unstructured Data," Sustainability, MDPI, vol. 14(20), pages 1-24, October.
    15. Quan Gan & Wang Chun Wei & David Johnstone, 2015. "A faster estimation method for the probability of informed trading using hierarchical agglomerative clustering," Quantitative Finance, Taylor & Francis Journals, vol. 15(11), pages 1805-1821, November.
    16. Taneja, Anu & Arora, Anuja, 2019. "Modeling user preferences using neural networks and tensor factorization model," International Journal of Information Management, Elsevier, vol. 45(C), pages 132-148.
    17. Yuching Lu & Koki Tozuka & Goutam Chakraborty & Masafumi Matsuhara, 2021. "A Novel Item Cluster-Based Collaborative Filtering Recommendation System," The Review of Socionetwork Strategies, Springer, vol. 15(2), pages 327-346, November.
    18. Yimei Wang & Yongqian Liu & Li Li & David Infield & Shuang Han, 2018. "Short-Term Wind Power Forecasting Based on Clustering Pre-Calculated CFD Method," Energies, MDPI, vol. 11(4), pages 1-19, April.
    19. Jonghyeon Ko & Marco Comuzzi, 2023. "A Systematic Review of Anomaly Detection for Business Process Event Logs," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 65(4), pages 441-462, August.
    20. Lahtinen, Tuomas J. & Hämäläinen, Raimo P. & Jenytin, Cosmo, 2020. "On preference elicitation processes which mitigate the accumulation of biases in multi-criteria decision analysis," European Journal of Operational Research, Elsevier, vol. 282(1), pages 201-210.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:303:y:2022:i:3:p:1304-1320. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.