Continuous update of business process trees using Continuous Inductive Miner

• Autorzy: Pawlak Tomasz P. , Górka Bartosz

Identyfikatory

DOI

10.24425/bpasts.2022.143551

• Języki publikacji: EN

Abstrakty

EN

Business processes are omnipresent in nowadays economy: companies operate repetitively to achieve their goals, e.g., deliver goods, complete orders. The business process model is the key to understanding, managing, controlling, and verifying the operations of a company. Modeling of business processes may be a legal requirement in some market segments, e.g., financial in the European Union, and a prerequisite for certification, e.g., of the ISO-9001 standard. However, business processes naturally evolve, and continuous model adaptation is essential for rapid spot and reaction to changes in the process. The main contribution of this work is the Continuous Inductive Miner (CIM) algorithm that discovers and continuously adapts the process tree, an established representation of the process model, using the batches of event logs of the business process. CIM joins the exclusive guarantees of its two batch predecessors, the Inductive Miner (IM) and the Inductive Miner – directlyfollows-based (IMd): perfectly fit and sound models, and single-pass event log processing, respectively. CIM offers much shorter computation times in the update scenario than IM and IMd. CIM employs statistical information to work around the need to remember event logs as IM does while ensuring the perfect fit, contrary to IMd.

Słowa kluczowe

EN

business process; process mining; business intelligence; event log; concept drift

PL

proces biznesowy; górnictwo procesowe; wywiad gospodarczy; dziennik zdarzeń; dryf koncepcji

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 2023
• Tom: Vol. 71, nr 1
• Strony: art. no. e143551
• Opis fizyczny: Bibliogr. 59 poz., rys., tab.

Twórcy

autor

Pawlak Tomasz P.

• Institute of Computing Science, Poznan University of Technology, Poland

• https://orcid.org/0000-0002-8353-0562

autor

Górka Bartosz

• Institute of Computing Science, Poznan University of Technology, Poland

Bibliografia

• [1] M. Zaborowski, “Data processing in self-controlling enterprise processes,” Bull. Pol. Acad. Sci. Tech. Sci., vol. 67, no. 1, pp. 3–20, 2019.
• [2] XES Working Group, “IEEE Standard for eXtensible Event Stream (XES) for Achieving Interoperability in Event Logs and Event Streams,” IEEE Std 1849-2016, pp. 1–50, 2016.
• [3] W. van der Aalst, J. Buijs, and B. van Dongen, “Towards improving the representational bias of process mining,” in Data-Driven Process Discovery and Analysis. Berlin, Heidelberg: Springer, 2012, pp. 39–54.
• [4] W.M.P. van der Aalst, Process Mining: Data Science in Action, 2nd ed. Heidelberg: Springer, 2016.
• [5] S.J.J. Leemans, D. Fahland, and W.M.P. van der Aalst, “Discovering block-structured process models from event logs - a constructive approach,” in Application and Theory of Petri Nets and Concurrency. Springer, 2013, pp. 311–329.
• [6] S. Leemans, D. Fahland, and W. van der Aalst, “Discovering block-structured process models from incomplete event logs,” in Application and Theory of Petri Nets and Concurrency. Springer, 2014, pp. 91–110.
• [7] S.J.J. Leemans, D. Fahland, and W.M.P. van der Aalst, “Discovering block-structured process models from event logs containing infrequent behaviour,” in Business Process Management Workshops. Springer, 2014, pp. 66–78.
• [8] S.J.J. Leemans, D. Fahland, and W.M.P. van der Alast, “Scalable process discovery with guarantees,” in Enterprise, Business-Process and Information Systems Modeling. Cham: Springer, 2015, pp. 85–101.
• [9] J.A. Bergstra and J.W. Klop, “Acpτ a universal axiom system for process specification,” in Algebraic Methods: Theory, Tools and Applications. Berlin, Heidelberg: Springer, 1989, pp. 445–463.
• [10] D. Bechet, P. de Groote, and C. Retoré, “A complete axiomatisation for the inclusion of series-parallel partial orders,” in Rewriting Techniques and Applications. Berlin, Heidelberg: Springer, 1997, pp. 230–240.
• [11] G. Campero-Arena and J. Truss, “1-transitive cyclic orderings,” J. Comb. Theory Ser. A, vol. 116, no. 3, pp. 581–594, 2009.
• [12] A. Berti and W.M.P. van der Aalst, “Reviving token-based replay: Increasing speed while improving diagnostics,” in ATAED@ Petri Nets/ACSD. 2019, ser. CEUR Workshop Proceedings, vol. 2371. CEUR-WS.org, 2019, pp. 87–103.
• [13] J. Munoz-Gama and J. Carmona, “A fresh look at precision in process conformance,” in BPM 2010, ser. Lecture Notes in Computer Science, vol. 6336. Springer, 2010, pp. 211–226.
• [14] T. Murata, “Petri nets: Properties, analysis and applications,” Proc. IEEE, vol. 77, no. 4, pp. 541–580, 1989.
• [15] F. Folino, G. Greco, A. Guzzo, and L. Pontieri, “Mining usage scenarios in business processes: Outlier-aware discovery and run-time prediction,” Data Knowl. Eng., vol. 70, no. 12, pp. 1005–1029, 2011.
• [16] X. Liu, M. Alshangiti, C. Ding, and Q. Yu, “Log sequence clustering for workflow mining in multi-workflow systems,” Data Knowl. Eng., vol. 117, pp. 1–17, 2018.
• [17] J.C.A.M. Buijs, B.F. van Dongen, and W.M.P. van der Aalst, “A genetic algorithm for discovering process trees,” in 2012 IEEE Congress on Evolutionary Computation, 2012, pp. 1–8.
• [18] S.J.J. Leemans, N. Tax, and A.H.M. ter Hofstede, “Indulpet miner: Combining discovery algorithms,” in On the Move to Meaningful Internet Systems. OTM 2018 Conferences. Cham: Springer, 2018, pp. 97–115.
• [19] N. Tax, N. Sidorova, R. Haakma, and W.M. van der Aalst, “Mining local process models,” J. Innovation Digital Ecosyst., vol. 3, no. 2, pp. 183–196, 2016.
• [20] D. Redlich, T. Molka, W. Gilani, G. Blair, and A. Rashid, “Constructs competition miner: Process control-flow discovery of bp-domain constructs,” in Business Process Management. Cham: Springer, 2014, pp. 134–150.
• [21] D. Redlich, T. Molka, W. Gilani, G.S. Blair, and A. Rashid, “Scalable dynamic business process discovery with the constructs competition miner,” in SIMPDA 2014, 2014, pp. 91–107.
• [22] J. Carmona and R. Gavaldà, “Online techniques for dealing with concept drift in process mining,” in Advances in Intelligent Data Analysis XI. Berlin, Heidelberg: Springer, 2012, pp. 90–102.
• [23] A. Bifet and R. Gavaldà, “Learning from time-changing data with adaptive windowing,” in In SIAM International Conference on Data Mining, 2007.
• [24] S. van Zelst, B. van Dongen, and W. van der Aalst, “Event stream-based process discovery using abstract representations,” Knowl. Inf. Syst., no. 54, pp. 407–435, 2018.
• [25] R.P.J.C. Bose, W.M.P. van der Aalst, I. Žliobaitė, and M. Pechenizkiy, “Dealing with concept drifts in process mining,” IEEE Trans. Neural Networks, vol. 25, no. 1, pp. 154–171, 2014.
• [26] F. Stertz and S. Rinderle-Ma, “Process histories - detecting and representing concept drifts based on event streams,” in On the Move to Meaningful Internet Systems. OTM 2018 Conferences. Springer, 2018, pp. 318–335.
• [27] A. Burattin, M. Cimitile, F.M. Maggi, and A. Sperduti, “Online discovery of declarative process models from event streams,” IEEE Trans. Serv. Comput., vol. 8, no. 6, pp. 833–846, 2015.
• [28] A. Burattin, A. Sperduti, and W.M.P. van der Aalst, “Control-flow discovery from event streams,” in 2014 IEEE Congress on Evolutionary Computation (CEC), 2014, pp. 2420–2427.
• [29] J. Potoniec, D. Sroka, and T.P. Pawlak, “Continuous discovery of causal nets for non-stationary business processes using the on-line miner,” Eur. J. Oper. Res., vol. 303, pp. 1304–1320, 2022.
• [30] A. Polyvyanyy, J. Vanhatalo, and H. Völzer, “Simplified computation and generalization of the refined process structure tree,” in Web Services and Formal Methods. Berlin, Heidelberg: Springer, 2011, pp. 25–41.
• [31] A. Polyvyanyy, L. García-Bañuelos, D. Fahland, and M. Weske, “Maximal Structuring of Acyclic Process Models,” Comput. J., vol. 57, no. 1, pp. 12–35, 09 2012.
• [32] A. Augusto, R. Conforti, M. Dumas, M. La Rosa, and G. Bruno, “Automated discovery of structured process models from event logs: The discover-and-structure approach,” Data Knowl. Eng., vol. 117, pp. 373–392, 2018.
• [33] A.J.M.M. Weijters and J.T.S. Ribeiro, “Flexible heuristics miner (FHM),” in Computational Intelligence and Data Mining (CIDM), 2011 IEEE Symposium on. IEEE, 2011, pp. 310–317.
• [34] OMG, “Business Process Model and Notation (BPMN), Version 2.0,” Object Management Group, 2011.
• [35] G. Greco, A. Guzzo, and L. Pontieri, “Mining taxonomies of process models,” Data Knowl. Eng., vol. 67, no. 1, pp. 74–102, 2008.
• [36] W. van der Aalst, T. Weijters, and L. Maruster, “Workflow mining: discovering process models from event logs,” IEEE Trans. Knowl. Data Eng., vol. 16, no. 9, pp. 1128–1142, 2004.
• [37] S. Goedertier, J. De Weerdt, D. Martens, J. Vanthienen, and B. Baesens, “Process discovery in event logs: An application in the telecom industry,” Appl. Soft Comput., vol. 11, no. 2, pp. 1697–1710, 2011.
• [38] A. Alves De Medeiros, A. Weijters, and W. Aalst, van der, “Genetic process mining: an experimental evaluation,” Data Min. Knowl. Discovery, vol. 14, no. 2, pp. 245–304, 2007.
• [39] S. Goedertier, D. Martens, J. Vanthienen, and B. Baesens, “Robust process discovery with artificial negative events,” J. Mach. Learn. Res., vol. 10, pp. 1305–1340, 2009.
• [40] H. Sun, W. Liu, L. Qi, Y. Du, X. Ren, and X. Liu, “A process mining algorithm to mixed multiple-concurrency short-loop structures,” Inf. Sci., vol. 542, pp. 453–475, 2021.
• [41] L. Wen, J. Wang, W.M. van der Aalst, B. Huang, and J. Sun, “Mining process models with prime invisible tasks,” Data Knowl. Eng., vol. 69, no. 10, pp. 999–1021, 2010.
• [42] A. Augusto, R. Conforti, M. Dumas, M.L. Rosa, F.M. Maggi, A. Marrella, M. Mecella, and A. Soo, “Automated discovery of process models from event logs: Review and benchmark,” IEEE Trans. Knowl. Data Eng., vol. 31, no. 4, pp. 686–705, 2019.
• [43] A. Augusto, R. Conforti, M. Dumas, and M. La Rosa, “Split miner: automated discovery of accurate and simple business process models from event logs,” Knowl. Inf. Syst., no. 59, p. 251–284, 2019.
• [44] B. Vázquez-Barreiros, M. Mucientes, and M. Lama, “Prodigen: Mining complete, precise and minimal structure process models with a genetic algorithm,” Inf. Sci., vol. 294, pp. 315–333, 2015.
• [45] P. Kudła and T.P. Pawlak, “One-class synthesis of constraints for mixed-integer linear programming with C4.5 decision trees,” Appl. Soft Comput., vol. 68, pp. 1–12, 2018.
• [46] H. Williams, Model Building in Mathematical Programming. Wiley, 2013.
• [47] R. Tarjan, “Depth-first search and linear graph algorithms,” SIAM J. Comput., vol. 1, no. 2, pp. 146–160, 1972.
• [48] E. Nuutila and E. Soisalon-Soininen, “On finding the strongly connected components in a directed graph,” Inf. Process. Lett., vol. 49, no. 1, pp. 9–14, 1994.
• [49] W. Steeman, “BPI challenge 2013,” Apr 2014.
• [50] B.B. van Dongen, “BPI challenge 2015,” May 2015, doi: 10.4121/uuid:31a308ef-c844-48da-948c-305d167a0ec1.
• [51] J. Buijs, “Environmental permit application process (‘WABO’), CoSeLoG project,” May 2014, doi: 10.4121/uuid:26aba40d-8b2d-435b-b5af-6d4bfbd7a270.
• [52] B. van Dongen, “Real-life event logs – Hospital log,” 3 2011, doi: 10.4121/uuid:d9769f3d-0ab0-4fb8-803b-0d1120ffcf54.
• [53] J. Buijs, “Receipt phase of an environmental permit application process (‘WABO’), CoSeLoG project,” 8 2014, doi: 10.4121/uuid:a07386a5-7be3-4367-9535-70bc9e77dbe6.
• [54] F. Mannhardt, “Sepsis cases – event log,” Dec 2016, doi: 10.4121/uuid:915d2bfb-7e84-49ad-a286-dc35f063a460.
• [55] M. Leemans, W.M.P. van der Aalst, and M.G.J. van den Brand, “Recursion aware modeling and discovery for hierarchical software event log analysis,” in 2018 IEEE 25th International Conference on Software Analysis, Evolution and Reengineering (SANER), 2018, pp. 185–196.
• [56] 4TU, “4TU.ResearchData,” 2022. [Online]. Available: https://data.4tu.nl
• [57] G. Kanji, 100 Statistical Tests. SAGE Publications, 1999.
• [58] S. Holm, “A simple sequentially rejective multiple test procedure,” Scand. J. Stat., vol. 6, no. 2, pp. 65–70, 1979.
• [59] R. Conforti, M.L. Rosa, and A.H.M. t. Hofstede, “Filtering out infrequent behavior from business process event logs,” IEEE Trans. Knowl. Data Eng., vol. 29, no. 2, pp. 300–314, 2017.

Uwagi

Opracowanie rekordu ze środków MEiN, umowa nr SONP/SP/546092/2022 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2022-2023).