{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T16:46:38Z","timestamp":1776876398568,"version":"3.51.2"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031822247","type":"print"},{"value":"9783031822254","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"vor","delay-in-days":86,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Various kinds of uncertainty can occur in event logs, e.g., due to flawed recording, data quality issues, or the use of probabilistic models for activity recognition. Stochastically known event logs make these uncertainties transparent by encoding multiple possible realizations for events. However, the number of realizations encoded by a stochastically known log grows exponentially with its size, making exhaustive exploration infeasible even for moderately sized event logs. Thus, considering only the top-K most probable realizations has been proposed in the literature. In this paper, we implement an efficient algorithm to calculate a top-K realization ranking of an event log under event independence within O(Kn), where n is the number of uncertain events in the log. This algorithm is used to investigate the benefit of top-K rankings over top-1 interpretations of stochastically known event logs. Specifically, we analyze the usefulness of top-K rankings against different properties of the input data. We show that the benefit of a top-K ranking depends on the length of the input event log and the distribution of the event probabilities. The results highlight the potential of top-K rankings to enhance uncertainty-aware process mining techniques.<\/jats:p>","DOI":"10.1007\/978-3-031-82225-4_26","type":"book-chapter","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T03:02:09Z","timestamp":1743303729000},"page":"350-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Ranking the\u00a0Top-K Realizations of\u00a0Stochastically Known Event Logs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8105-382X","authenticated-orcid":false,"given":"Arvid","family":"Lepsien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8997-7517","authenticated-orcid":false,"given":"Marco","family":"Pegoraro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8445-8104","authenticated-orcid":false,"given":"Frederik","family":"Fonger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0238-324X","authenticated-orcid":false,"given":"Dominic","family":"Langhammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0472-1262","authenticated-orcid":false,"given":"Milda","family":"Aleknonyt\u0117-Resch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8206-7636","authenticated-orcid":false,"given":"Agnes","family":"Koschmider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"26_CR1","unstructured":"van der Aalst, W., et al.: Process mining manifesto. In: BPM 2011 Workshops. LNBIP, vol. 99, pp. 169\u2013194. Springer, Heidelberg (2012)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bogdanov, E., Cohen, I., Gal, A.: SKTR: trace recovery from stochastically known logs. In: ICPM 2023, Rome, Italy, pp. 49\u201356. IEEE (2023)","DOI":"10.1109\/ICPM60904.2023.10271985"},{"key":"26_CR3","unstructured":"Engelberg, G., et\u00a0al.: An uncertainty-aware event log of network traffic. In: BPM 2023 Demos, vol.\u00a03469. CEUR-WS.org (2023)"},{"key":"26_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106895","volume":"126","author":"P Felli","year":"2023","unstructured":"Felli, P., et al.: Multi-perspective conformance checking of uncertain process traces: an SMT-based approach. Eng. Appl. Artif. Intell. 126, 106895 (2023)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Gal, A.: Everything there is to know about stochastically known logs. In: ICPM 2023, Rome, Italy, pp. xvii\u2013xxiii. IEEE (2023)","DOI":"10.1109\/ICPM60904.2023.10271980"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Gao, J., et\u00a0al.: Fast top-k simple shortest paths discovery in graphs. In: CIKM 2010, Toronto, Canada, pp. 509\u2013518. ACM (2010)","DOI":"10.1145\/1871437.1871504"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BF02022039","volume":"4","author":"HW Hamacher","year":"1985","unstructured":"Hamacher, H.W., Queyranne, M.: K best solutions to combinatorial optimization problems. Ann. Oper. Res. 4(1), 123\u2013143 (1985)","journal-title":"Ann. Oper. Res."},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Kecht, C., et\u00a0al.: Event log construction from customer service conversations using natural language inference. In: ICPM 2021, Eindhoven, Netherlands, pp. 144\u2013151. IEEE (2021)","DOI":"10.1109\/ICPM53251.2021.9576869"},{"key":"26_CR9","unstructured":"Koschmider, A., et\u00a0al.: Process mining for unstructured data: challenges and research directions. In: Modellierung 2024, Bonn. LNI, vol.\u00a0P348, pp. 119\u2013136. GI (2024)"},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Lepsien, A., Koschmider, A., Kratsch, W.: Analytics pipeline for process mining on video data. In: BPM 2023 Forum. LNBIP, vol. 490, pp. 196\u2013213. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-41623-1_12"},{"issue":"3","key":"26_CR11","first-page":"243","volume":"1","author":"M Pascoal","year":"2003","unstructured":"Pascoal, M., Captivo, M.E., Cl\u00edmaco, J.: A note on a new variant of Murty\u2019s ranking assignments algorithm. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(3), 243\u2013255 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"26_CR12","unstructured":"Pegoraro, M.: Probabilistic and non-deterministic event data in process mining: embedding uncertainty in process analysis techniques. In: CAiSE 2022 Doctoral Consortium. CEUR-WS, Leuven, Belgium, vol. 3139, pp. 37\u201346. CEUR-WS.org (2022)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Pegoraro, M., Bakullari, B., Uysal, M.S., van der Aalst, W.M.P.: Probability estimation of uncertain process trace realizations. In: ICPM 2021 Workshops. LNBIP, vol. 433, pp. 21\u201333. Springer, Cham (2022)","DOI":"10.1007\/978-3-030-98581-3_2"},{"key":"26_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2021.101810","volume":"102","author":"M Pegoraro","year":"2021","unstructured":"Pegoraro, M., Uysal, M.S., van der Aalst, W.M.P.: Conformance checking over uncertain event data. Inf. Syst. 102, 101810 (2021)","journal-title":"Inf. Syst."},{"issue":"11","key":"26_CR15","doi-asserted-by":"publisher","first-page":"1124","DOI":"10.14778\/2350229.2350233","volume":"5","author":"L Qin","year":"2012","unstructured":"Qin, L., Yu, J.X., Chang, L.: Diversifying top-k results. Proc. VLDB Endow. 5(11), 1124\u20131135 (2012)","journal-title":"Proc. VLDB Endow."},{"key":"26_CR16","doi-asserted-by":"crossref","unstructured":"Soliman, M.A., Ilyas, I.F., Chang, K.C.C.: Probabilistic top-k and ranking-aggregate queries. ACM Trans. Datab. Syst. 33(3), 13:1\u201313:54 (2008)","DOI":"10.1145\/1386118.1386119"}],"container-title":["Lecture Notes in Business Information Processing","Process Mining Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-82225-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T16:04:50Z","timestamp":1760889890000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-82225-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031822247","9783031822254"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-82225-4_26","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"28 March 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Process Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lyngby","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icpmconference.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}