{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T19:06:34Z","timestamp":1780772794245,"version":"3.54.1"},"publisher-location":"Cham","reference-count":80,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031088476","type":"print"},{"value":"9783031088483","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T00:00:00Z","timestamp":1656288000000},"content-version":"vor","delay-in-days":177,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Given the challenges associated to the process discovery task, more than a hundred research studies addressed the problem over the past two decades. Despite the richness of proposals, many state-of-the-art automated process discovery techniques, especially the oldest ones, struggle to systematically discover accurate and simple process models. In general, when the behavior recorded in the input event log is simple (e.g., exhibiting little parallelism, repetitions, or inclusive choices) or noise free, some basic algorithms such as the alpha miner can output accurate and simple process models. However, as the complexity of the input data increases, the quality of the discovered process models can worsen quickly. Given that oftentimes real-life event logs record very complex and unstructured process behavior containing many repetitions, infrequent traces, and incomplete data, some state-of-the-art techniques turn unreliable and not purposeful. Specifically, they tend to discover process models that either have limited accuracy (i.e., low fitness and\/or precision) or are syntactically incorrect. While currently there exists no perfect automated process discovery technique, some are better than others when discovering a process model from event logs recording complex process behavior. In this chapter, we introduce four of such techniques, discussing their underlying approach and algorithmic ideas, reporting their benefits and limitation, and comparing their performance with the algorithms introduced in the previous chapter.<\/jats:p>","DOI":"10.1007\/978-3-031-08848-3_3","type":"book-chapter","created":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T23:02:48Z","timestamp":1656284568000},"page":"76-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Advanced Process Discovery Techniques"],"prefix":"10.1007","author":[{"given":"Adriano","family":"Augusto","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Josep","family":"Carmona","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eric","family":"Verbeek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,6,27]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Alizadeh, S., Norani, A.: ICMA: a new efficient algorithm for process model discovery. Appl. Intell. 48(11) (2018)","DOI":"10.1007\/s10489-018-1213-3"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Augusto, A., et al.: Automated discovery of process models from event logs: Rev. Benchmark. IEEE TKDE 31(4) (2019)","DOI":"10.1109\/TKDE.2018.2841877"},{"issue":"2","key":"3_CR3","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10115-018-1214-x","volume":"59","author":"A Augusto","year":"2018","unstructured":"Augusto, A., Conforti, R., Dumas, M., La Rosa, M., Polyvyanyy, A.: Split miner: automated discovery of accurate and simple business process models from event logs. Knowl. Inf. Syst. 59(2), 251\u2013284 (2018). https:\/\/doi.org\/10.1007\/s10115-018-1214-x","journal-title":"Knowl. Inf. Syst."},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-46397-1_25","volume-title":"Conceptual Modeling","author":"A Augusto","year":"2016","unstructured":"Augusto, A., Conforti, R., Dumas, M., La Rosa, M., Bruno, G.: Automated discovery of structured process models: discover structured vs. discover and structure. In: Comyn-Wattiau, I., Tanaka, K., Song, I.-Y., Yamamoto, S., Saeki, M. (eds.) ER 2016. LNCS, vol. 9974, pp. 313\u2013329. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46397-1_25"},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Augusto,A., Dumas, M., La Rosa, M.:Automated discovery of process models with true concurrency and inclusive choices. In: International Conference on Process Mining, pp. 43\u201356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-98581-3_1","DOI":"10.1007\/978-3-030-98581-3_1"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Badouel, E., Bernardinello, L., Darondeau. Ph.: Polynomial algorithms for the synthesis of bounded nets. In: TAPSOFT, pp. 364\u2013378 (1995)","DOI":"10.1007\/3-540-59293-8_207"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-540-75183-0_27","volume-title":"Business Process Management","author":"R Bergenthum","year":"2007","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Process mining based on regions of languages. In: Alonso, G., Dadam, P., Rosemann, M. (eds.) BPM 2007. LNCS, vol. 4714, pp. 375\u2013383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75183-0_27"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bergenthum, R., Desel, J., Lorenz, R., Mauser, S.: Synthesis of petri nets from infinite partial languages. In: Billington, J., Duan, J., Koutny, M. (eds.) ACSD, pp. 170\u2013179. IEEE (2008)","DOI":"10.1109\/ACSD.2008.4574609"},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"187","DOI":"10.3233\/FI-2009-147","volume":"95","author":"R Bergenthum","year":"2009","unstructured":"Bergenthum, R., Desel, J., Mauser, S., Lorenz, R.: Synthesis of petri nets from term based representations of infinite partial languages. Fundam. Inform. 95(1), 187\u2013217 (2009)","journal-title":"Fundam. Inform."},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Bernardi, M.L., Cimitile, M., Di Francescomarino, C., Maggi, F.M.: Do activity lifecycles affect the validity of a business rule in a business process? Inf. Syst. 62 (2016)","DOI":"10.1016\/j.is.2016.06.002"},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-33606-5_19","volume-title":"On the Move to Meaningful Internet Systems: OTM 2012","author":"JCAM Buijs","year":"2012","unstructured":"Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: On the role of fitness, precision, generalization and simplicity in process discovery. In: Meersman, R., et al. (eds.) OTM 2012. LNCS, vol. 7565, pp. 305\u2013322. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33606-5_19"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: A genetic algorithm for discovering process trees. In: IEEE Congress on Evolutionary Computation (CEC), 2012, pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6256458"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: Quality dimensions in process discovery: the importance of fitness, precision, generalization and simplicity. Int. J. Cooperat. Inf. Syst. 23(01),1440001 (2014)","DOI":"10.1142\/S0218843014400012"},{"key":"3_CR14","unstructured":"Carmona, J., Depaire, B., Verbeek, H.M.W.: Process discovery contest 2020 (2019). https:\/\/icpmconference.org\/2020\/process-discovery-contest\/. Accessed 23 Apr 2021"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/s10618-011-0226-x","volume":"24","author":"J Carmona","year":"2012","unstructured":"Carmona, J.: Projection approaches to process mining using region-based techniques. Data Min. Knowl. Discov. 24(1), 218\u2013246 (2012)","journal-title":"Data Min. Knowl. Discov."},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-03848-8_22","volume-title":"Business Process Management","author":"J Carmona","year":"2009","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: Divide-and-conquer strategies for process mining. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 327\u2013343. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03848-8_22"},{"issue":"3","key":"3_CR17","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TC.2009.131","volume":"59","author":"J Carmona","year":"2009","unstructured":"Carmona, J., Cortadella, J., Kishinevsky, M.: New region-based algorithms for deriving bounded Petri nets. IEEE Trans. Comput. 59(3), 371\u2013384 (2009)","journal-title":"IEEE Trans. Comput."},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCP.2012.6356199","volume-title":"Hybrid particle swarm optimization method for process mining","author":"VR Chifu","year":"2012","unstructured":"Chifu, V.R., Pop, C.B., Salomie, I., Balla, I., Paven, R.: Hybrid particle swarm optimization method for process mining. In: ICCP, IEEE (2012)"},{"issue":"2","key":"3_CR19","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2016.2614680","volume":"29","author":"R Conforti","year":"2016","unstructured":"Conforti, R., La Rosa, M., ter Hofstede, A.H.M.: Filtering out infrequent behavior from business process event logs. IEEE Trans. Knowl. Data Eng. 29(2), 300\u2013314 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR20","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1016\/j.is.2015.07.004","volume":"56","author":"R Conforti","year":"2016","unstructured":"Conforti, R., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L., La Rosa, M.: BPMN miner: automated discovery of BPMN process models with hierarchical structure. Inf. Syst. 56, 284\u2013303 (2016)","journal-title":"Inf. Syst."},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-030-58666-9_19","volume-title":"Business Process Management","author":"R Conforti","year":"2020","unstructured":"Conforti, R., La Rosa, M., ter Hofstede, A.H.M., Augusto, A.: Automatic repair of same-timestamp errors in business process event logs. In: Fahland, D., Ghidini, C., Becker, J., Dumas, M. (eds.) BPM 2020. LNCS, vol. 12168, pp. 327\u2013345. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58666-9_19"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/BFb0055646","volume-title":"CONCUR\u201998 Concurrency Theory","author":"P Darondeau","year":"1998","unstructured":"Darondeau, P.: Deriving unbounded Petri nets from formal languages. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 533\u2013548. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055646"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Ponce de Le\u00f3n, H., Nardelli, L., Carmona, J., vanden Broucke, S.K.L.M.: Incorporating negative information to process discovery of complex systems. Inf. Sci. 422, 480\u2013496 (2018)","DOI":"10.1016\/j.ins.2017.09.027"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-319-24953-7_4","volume-title":"Automated Technology for Verification and Analysis","author":"H Ponce-de-Le\u00f3n","year":"2015","unstructured":"Ponce-de-Le\u00f3n, H., Rodr\u00edguez, C., Carmona, J., Heljanko, K., Haar, S.: Unfolding-based process discovery. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 31\u201347. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24953-7_4"},{"key":"3_CR25","unstructured":"Alves de Medeiros, A.K.: Genetic process mining. Ph.D. thesis, Eindhoven University of Technology (2006)"},{"issue":"4","key":"3_CR26","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s002360050046","volume":"33","author":"J Desel","year":"1996","unstructured":"Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Inf. 33(4), 297\u2013315 (1996)","journal-title":"Acta Inf."},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Di Ciccio, C., Mecella, M.: A two-step fast algorithm for the automated discovery of declarative workflows. In: 2013 IEEE Symposium on Computational Intelligence and Data Mining (CIDM), pp. 135\u2013142. IEEE (2013)","DOI":"10.1109\/CIDM.2013.6597228"},{"key":"3_CR28","doi-asserted-by":"publisher","unstructured":"Dumas, M., La Rosa, M., Mendling, J., Reijers, H.A.: Fundamentals of Business Process Management. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-3-662-56509-4","DOI":"10.1007\/978-3-662-56509-4"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"Effendi, Y.A., Sarno, P.: Discovering optimized process model using rule discovery hybrid particle swarm optimization. In: 2017 3rd International Conference on Science in Information Technology (ICSI Tech), pp. 97\u2013103. IEEE (2017)","DOI":"10.1109\/ICSITech.2017.8257092"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Partial (Set) 2-structures. Part I, II. Acta Inform. 27, 315\u2013368 (1990)","DOI":"10.1007\/BF00264612"},{"key":"3_CR31","volume-title":"An improved simulated annealing algorithm for process mining","author":"D Gao","year":"2009","unstructured":"Gao, D., Liu, Q.: An improved simulated annealing algorithm for process mining. In: CSCWD, IEEE (2009)"},{"key":"3_CR32","doi-asserted-by":"publisher","unstructured":"Ghionna, L., Greco, G., Guzzo, A., Pontieri, L.: Outlier detection techniques for process mining applications. In: An, A., Matwin, S., Ras, Z.W., Slezak, D. (eds.) ISMIS 2008. LNCS (LNAI), vol. 4994, pp. 150\u2013159. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68123-6_17","DOI":"10.1007\/978-3-540-68123-6_17"},{"key":"3_CR33","first-page":"1305","volume":"10","author":"S Goedertier","year":"2009","unstructured":"Goedertier, S., Martens, D., Vanthienen, J., Baesens, B.: Robust process discovery with artificial negative events. J. Mach. Learn. Res. 10, 1305\u20131340 (2009)","journal-title":"J. Mach. Learn. Res."},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-23063-4_7","volume-title":"Business Process Management","author":"Q Guo","year":"2015","unstructured":"Guo, Q., Wen, L., Wang, J., Yan, Z., Yu, P.S.: Mining invisible tasks in non-free-choice constructs. In: Motahari-Nezhad, H.R., Recker, J., Weidlich, M. (eds.) BPM 2015. LNCS, vol. 9253, pp. 109\u2013125. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23063-4_7"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs containing infrequent behaviour. In: Lohmann, N., Song, M., Wohed, P. (eds.) BPM 2013. LNBIP, vol. 171, pp. 66\u201378. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-06257-0_6","DOI":"10.1007\/978-3-319-06257-0_6"},{"key":"3_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-319-07734-5_6","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"SJJ Leemans","year":"2014","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from incomplete event logs. In: Ciardo, G., Kindler, E. (eds.) PETRI NETS 2014. LNCS, vol. 8489, pp. 91\u2013110. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07734-5_6"},{"key":"3_CR37","unstructured":"Lorenz, R.: Towards synthesis of petri nets from general partial languages. In: Lohmann, N., Wolf, K. (eds.) AWPN, vol. 380 of CEUR Workshop Proceedings, pp. 55\u201362. CEUR-WS.org (2008)"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Lorenz, R., Juh\u00e1s, R.: How to synthesize nets from languages - a survey. In: Proceedings of the Wintersimulation Conference (WSC) 2007 (2007)","DOI":"10.1109\/WSC.2007.4419657"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-642-31095-9_18","volume-title":"Advanced Information Systems Engineering","author":"FM Maggi","year":"2012","unstructured":"Maggi, F.M., Bose, R.P.J.C., van der Aalst, W.M.P.: Efficient discovery of understandable declarative process models from event logs. In: Ralyt\u00e9, J., Franch, X., Brinkkemper, S., Wrycza, S. (eds.) CAiSE 2012. LNCS, vol. 7328, pp. 270\u2013285. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31095-9_18"},{"key":"3_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-40176-3_8","volume-title":"Business Process Management","author":"FM Maggi","year":"2013","unstructured":"Maggi, F.M., Dumas, M., Garc\u00eda-Ba\u00f1uelos, L., Montali, M.: Discovering data-aware declarative process models from event logs. In: Daniel, F., Wang, J., Weber, B. (eds.) BPM 2013. LNCS, vol. 8094, pp. 81\u201396. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40176-3_8"},{"key":"3_CR41","doi-asserted-by":"crossref","unstructured":"Mauser, S., Lorenz, S.: Variants of the language based synthesis problem for petri nets. In: ACSD, pp. 89\u201398 (2009)","DOI":"10.1109\/ACSD.2009.19"},{"key":"3_CR42","doi-asserted-by":"crossref","unstructured":"Mendling, J., Reijers, H.A., van der Aalst, W.M.P.: Seven process modeling guidelines (7PMG). Inform. Softw. Technol. 52(2), 127\u2013136 (2010)","DOI":"10.1016\/j.infsof.2009.08.004"},{"key":"3_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-319-59536-8_36","volume-title":"Advanced Information Systems Engineering","author":"H Nguyen","year":"2017","unstructured":"Nguyen, H., Dumas, M., ter Hofstede, A.H.M., La Rosa, M., Maggi, F.M.: Mining business process stages from event logs. In: Dubois, E., Pohl, K. (eds.) CAiSE 2017. LNCS, vol. 10253, pp. 577\u2013594. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59536-8_36"},{"key":"3_CR44","doi-asserted-by":"crossref","unstructured":"Nurlaili, A.L., Sarno, R.: A combination of the evolutionary tree miner and simulated annealing. In: 2017 4th International Conference on Electrical Engineering, Computer Science and Informatics (EECSI), pp. 1\u20135. IEEE (2017)","DOI":"10.1109\/EECSI.2017.8239134"},{"key":"3_CR45","doi-asserted-by":"crossref","unstructured":"Pesic, M., Schonenberg, H., van der Aalst, W.I.P.: DECLARE: full support for loosely-structured processes. In: 11th IEEE International Enterprise Distributed Object Computing Conference (EDOC 2007), 15\u201319 October 2007, Annapolis, Maryland, USA, pp. 287\u2013300 (2007)","DOI":"10.1109\/EDOC.2007.14"},{"key":"3_CR46","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Vanhatalo, J., V\u00f6lzer, H.: Simplified computation and generalization of the refined process structure tree. In: WS-FM, pp. 25\u201341 (2010)","DOI":"10.1007\/978-3-642-19589-1_2"},{"key":"3_CR47","unstructured":"Ribeiro, J., Carmona, J.: RS4PD: a tool for recommending control-flow algorithms. In: BPM (Demos), pp. 66. Citeseer (2014)"},{"key":"3_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-10172-9_5","volume-title":"Business Process Management","author":"J Ribeiro","year":"2014","unstructured":"Ribeiro, J., Carmona, J., M\u0131s\u0131r, M., Sebag, M.: A recommender system for process discovery. In: Sadiq, S., Soffer, P., V\u00f6lzer, H. (eds.) BPM 2014. LNCS, vol. 8659, pp. 67\u201383. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10172-9_5"},{"key":"3_CR49","unstructured":"Ribeiro, J., Carmona Vargas, J.: A method for assessing parameter impact on control-flow discovery algorithms. In: Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data: Brussels, Belgium, 22\u201323 June 2015, pp. 83\u201396. CEUR-WS. org (2015)"},{"key":"3_CR50","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-41641-5_10","volume-title":"The Practice of Enterprise Modeling","author":"A Rogge-Solti","year":"2013","unstructured":"Rogge-Solti, A., Mans, R.S., van der Aalst, W.M.P., Weske, M.: Improving Documentation by repairing event logs. In: Grabis, J., Kirikova, M., Zdravkovic, J., Stirna, J. (eds.) PoEM 2013. LNBIP, vol. 165, pp. 129\u2013144. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41641-5_10"},{"key":"3_CR51","doi-asserted-by":"crossref","unstructured":"Sani, M.F., van Zelst, S.J., van der Aalst, W.M.P.: Improving process discovery results by filtering outliers using conditional behavioural probabilities. In: International Workshop on Business Process Intelligence (BPI 2017) (2017)","DOI":"10.1007\/978-3-319-74030-0_16"},{"key":"3_CR52","first-page":"1","volume":"14","author":"MF Sani","year":"2019","unstructured":"Sani, M.F., van Zelst, S.J., van der Aalst, W.M.P.: Repairing outlier behaviour in event logs using contextual behaviour. EMISAJ 14, 1\u201324 (2019)","journal-title":"EMISAJ"},{"key":"3_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-319-39696-5_18","volume-title":"Advanced Information Systems Engineering","author":"S Sch\u00f6nig","year":"2016","unstructured":"Sch\u00f6nig, S., Rogge-Solti, A., Cabanillas, C., Jablonski, S., Mendling, J.: Efficient and customisable declarative process mining with SQL. In: Nurcan, S., Soffer, P., Bajec, M., Eder, J. (eds.) CAiSE 2016. LNCS, vol. 9694, pp. 290\u2013305. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39696-5_18"},{"issue":"3\u20134","key":"3_CR54","doi-asserted-by":"publisher","first-page":"343","DOI":"10.3233\/FI-2011-612","volume":"113","author":"M Sol\u00e9","year":"2011","unstructured":"Sol\u00e9, M., Carmona, J.: Light region-based techniques for process discovery. Fundam. Inform. 113(3\u20134), 343\u2013376 (2011)","journal-title":"Fundam. Inform."},{"key":"3_CR55","doi-asserted-by":"crossref","unstructured":"Sol\u00e9, M., Carmona, J.: Incremental process discovery. Trans. Petri Nets Other Models of Concurr. 5, 221\u2013242 (2012)","DOI":"10.1007\/978-3-642-29072-5_10"},{"issue":"1","key":"3_CR56","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TKDE.2011.192","volume":"25","author":"M Sol\u00e9","year":"2013","unstructured":"Sol\u00e9, M., Carmona, J.: Region-based foldings in process discovery. IEEE Trans. Knowl. Data Eng. 25(1), 192\u2013205 (2013)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3_CR57","doi-asserted-by":"crossref","unstructured":"Song, S., Cao, Y., Wang, J.: Cleaning timestamps with temporal constraints. VLDB Endow. 9(10), 708\u2013719 (2016)","DOI":"10.14778\/2977797.2977798"},{"key":"3_CR58","doi-asserted-by":"publisher","DOI":"10.1109\/ICYCS.2008.279","volume-title":"Business process mining based on simulated annealing","author":"W Song","year":"2008","unstructured":"Song, W., Liu, S., Liu, Q.: Business process mining based on simulated annealing. In: ICYCS, IEEE (2008)"},{"key":"3_CR59","doi-asserted-by":"crossref","unstructured":"Tax, N., Sidorova, N., van der Aalst, W.M.P.: Discovering more precise process models from event logs by filtering out chaotic activities. J. Intell. Inf. Syst., 52(1), 107\u2013139 (2019)","DOI":"10.1007\/s10844-018-0507-6"},{"key":"3_CR60","doi-asserted-by":"crossref","unstructured":"van der Aalst, W., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16(9) (2004)","DOI":"10.1109\/TKDE.2004.47"},{"key":"3_CR61","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., G\u00fcnther, C.W.: Finding structure in unstructured processes: the case for process mining. In: ACSD, pp. 3\u201312 (2007)","DOI":"10.1109\/ACSD.2007.50"},{"key":"3_CR62","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., Rubin, V., (Eric) Verbeek, H.M.W., van Dongen, B.F., Kindler, E., G\u00fcnther, C.W.: Process mining: a two-step approach to balance between underfitting and overfitting. Softw. Syst. Model. 9, 87\u2013111 (2009)","DOI":"10.1007\/s10270-008-0106-z"},{"key":"3_CR63","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., van Dongen, B.F.: Discovering petri nets from event logs. Trans. Petri Nets Other Models Concurr. 7, 372\u2013422 (2013)","DOI":"10.1007\/978-3-642-38143-0_10"},{"key":"3_CR64","doi-asserted-by":"crossref","unstructured":"van der Aalst, W.M.P., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Trans. Knowl. Data Eng. 16(9), 1128\u20131142 (2004)","DOI":"10.1109\/TKDE.2004.47"},{"key":"3_CR65","doi-asserted-by":"crossref","unstructured":"van der Werf, J.M.E.M., van Dongen, B.F., Hurkens, C.A.J., Serebrenik, A.: Process discovery using integer linear programming. Fundam. Inform. 94(3\u20134), 387\u2013412 (2009)","DOI":"10.3233\/FI-2009-136"},{"key":"3_CR66","unstructured":"van Zelst, S.J., van Dongen, B.F., van der Aalst, W.M.P.: ILP-based process discovery using hybrid regions. In van der Aalst, W.M.P., Bergenthum, R., Carmona, J. (eds.) Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, Satellite Event of the Conferences: 36th International Conference on Application and Theory of Petri Nets and Concurrency Petri Nets 2015 and 15th International Conference on Application of Concurrency to System Design ACSD 2015, Brussels, Belgium, 22\u201323 June 2015, vol. 1371 of CEUR Workshop Proceedings, pp. 47\u201361. CEUR-WS.org (2015)"},{"key":"3_CR67","unstructured":"van Zelst, S.J., van Dongen, B.F., van der Aalst, W.M.P.: ILP-based process discovery using hybrid regions. In: International Workshop on Algorithms & Theories for the Analysis of Event Data, ATAED 2015, vol. 1371 of CEUR Workshop Proceedings, pp. 47\u201361. CEUR-WS.org (2015)"},{"issue":"5","key":"3_CR68","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00607-017-0582-5","volume":"100","author":"SJ van Zelst","year":"2017","unstructured":"van Zelst, S.J., van Dongen, B.F., van\u00a0der Aalst, W.M.P., Verbeek, H.M.W.: Discovering workflow nets using integer linear programming. Computing 100(5), 529\u2013556 (2017). https:\/\/doi.org\/10.1007\/s00607-017-0582-5","journal-title":"Computing"},{"key":"3_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-319-91563-0_3","volume-title":"Advanced Information Systems Engineering","author":"SJ van Zelst","year":"2018","unstructured":"van Zelst, S.J., Fani Sani, M., Ostovar, A., Conforti, R., La Rosa, M.: Filtering spurious events from event streams of business processes. In: Krogstie, J., Reijers, H.A. (eds.) CAiSE 2018. LNCS, vol. 10816, pp. 35\u201352. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-91563-0_3"},{"key":"3_CR70","doi-asserted-by":"crossref","unstructured":"van Zelst, S.J., Fani Sani, M., Ostovar, A., Conforti, R., La Rosa, M.: Detection and removal of infrequent behaviour from event streams of business processes. Inf. Syst. 90 (2019)","DOI":"10.1016\/j.is.2019.101451"},{"key":"3_CR71","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-31095-9_17","volume-title":"Advanced Information Systems Engineering","author":"SKLM vanden Broucke","year":"2012","unstructured":"vanden Broucke, S.K.L.M., De Weerdt, J., Baesens, B., Vanthienen, J.: Improved artificial negative event generation to enhance process event logs. In: Ralyt\u00e9, J., Franch, X., Brinkkemper, S., Wrycza, S. (eds.) CAiSE 2012. LNCS, vol. 7328, pp. 254\u2013269. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31095-9_17"},{"key":"3_CR72","doi-asserted-by":"crossref","unstructured":"vanden Broucke, S.K.L.M., De Weerdt, J., Vanthienen, J., Baesens, B.: Determining process model precision and generalization with weighted artificial negative events. IEEE Trans. Knowl. Data Eng, 26(8), 1877\u20131889 (2014)","DOI":"10.1109\/TKDE.2013.130"},{"key":"3_CR73","doi-asserted-by":"crossref","unstructured":"vanden Broucke, S.K.L.M., De Weerdt, J.: Fodina: a robust and flexible heuristic process discovery technique. Decis. Supp. Syst. 100, 109\u2013118 (2017)","DOI":"10.1016\/j.dss.2017.04.005"},{"key":"3_CR74","doi-asserted-by":"crossref","unstructured":"vanden Broucke, S.K.L.M., Vanthienen, J., Baesens, B.: Declarative process discovery with evolutionary computing. In: 2014 IEEE Congress on Evolutionary Computation (CEC), pp. 2412\u20132419. IEEE (2014)","DOI":"10.1109\/CEC.2014.6900293"},{"key":"3_CR75","doi-asserted-by":"publisher","unstructured":"Verbeek, H.M.W.: The Log Skeleton Visualizer in ProM 6.9: the winning contribution to the process discovery contest 2019. Int. J. Softw. Tools Technol. Trans. 339 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00618-y","DOI":"10.1007\/s10009-021-00618-y"},{"key":"3_CR76","unstructured":"Verbeek, H.M.W. Buijs, J.C.A.M., van Dongen, B.F., van der Aalst, W.M.P.: ProM 6: the process mining toolkit. In: Proceedings of BPM Demonstration Track 2010, vol. 615, pp. 34\u201339. CEUR-WS.org (2010)"},{"key":"3_CR77","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-319-15895-2_23","volume-title":"Business Process Management Workshops","author":"HMW Verbeek","year":"2015","unstructured":"Verbeek, H.M.W., van der Aalst, W.M.P.: Decomposed process mining: the ILP case. In: Fournier, F., Mendling, J. (eds.) BPM 2014. LNBIP, vol. 202, pp. 264\u2013276. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-15895-2_23"},{"key":"3_CR78","doi-asserted-by":"crossref","unstructured":"Wang, J., Song, S., Lin, X., Zhu, X., Pei, J.: Cleaning structured event logs: a graph repair approach. In: Proceedings of IEEE ICDE, pp. 30\u201341. IEEE (2015)","DOI":"10.1109\/ICDE.2015.7113270"},{"key":"3_CR79","doi-asserted-by":"crossref","unstructured":"Weijters, A.J.M.M., Ribeiro, J.T.S.: Flexible heuristics miner (FHM). In: 2011 IEEE Symposium on Computational Intelligence and Data Mining (CIDM), pp. 310\u2013317. IEEE (2011)","DOI":"10.1109\/CIDM.2011.5949453"},{"key":"3_CR80","doi-asserted-by":"crossref","unstructured":"Weijters, A.J.M.M., van der Aalst, W.: Rediscovering workflow models from event-based data using little thumb. Integr. Comput.-Aid. Eng. 10(2) (2003)","DOI":"10.3233\/ICA-2003-10205"}],"container-title":["Lecture Notes in Business Information Processing","Process Mining Handbook"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08848-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:27:55Z","timestamp":1709825275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08848-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031088476","9783031088483"],"references-count":80,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08848-3_3","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}