{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T13:48:21Z","timestamp":1768312101553,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031561061","type":"print"},{"value":"9783031561078","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-56107-8_32","type":"book-chapter","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T12:02:06Z","timestamp":1712923326000},"page":"419-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Grouping Local Process Models"],"prefix":"10.1007","author":[{"given":"Viki","family":"Peeva","sequence":"first","affiliation":[]},{"given":"Wil M. P.","family":"van der Aalst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,13]]},"reference":[{"key":"32_CR1","unstructured":"van der Aalst, W.M.P.: Process Mining - Data Science in Action, Second Edition"},{"key":"32_CR2","doi-asserted-by":"crossref","unstructured":"Abu-Aisheh, Z., Raveaux, R., Ramel, J., Martineau, P.: An exact graph edit distance algorithm for solving pattern recognition problems. In: ICPRAM 2015, vol. 1, pp. 271\u2013278 (2015)","DOI":"10.5220\/0005209202710278"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Acheli, M., Grigori, D., Weidlich, M.: Efficient discovery of compact maximal behavioral patterns from event logs. In: CAiSE 2019 (2019)","DOI":"10.1007\/978-3-030-21290-2_36"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Becker, M., Laue, R.: A comparative survey of business process similarity measures. Comput. Ind. 63(2), 148\u2013167","DOI":"10.1016\/j.compind.2011.11.003"},{"key":"32_CR5","unstructured":"Brunings, M., Fahland, D., Verbeek, E.: Discover context-rich local process models (extended abstract). In: ICPM-D 2022 (2022)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Deeva, G., Weerdt, J.D.: Understanding automated feedback in learning processes by mining local patterns. In: BPM 2018 International Workshops, vol. 342, pp. 56\u201368 (2018)","DOI":"10.1007\/978-3-030-11641-5_5"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Delcoucq, L., Lecron, F., Fortemps, P., van der Aalst, W.M.P.: Resource-centric process mining: clustering using local process models. In: SAC \u201920: The 35th ACM\/SIGAPP Symposium on Applied Computing, online event, [Brno, Czech Republic], March 30\u20133 April 2020, pp. 45\u201352 (2020)","DOI":"10.1145\/3341105.3373864"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Dijkman, R.M., et al.: A short survey on process model similarity. In: Seminal Contributions to Information Systems Engineering, 25 Years of CAiSE, pp. 421\u2013427","DOI":"10.1007\/978-3-642-36926-1_34"},{"key":"32_CR9","unstructured":"Dumas, M., Garc\u00eda-Ba\u00f1uelos, L., Dijkman, R.M.: Similarity search of business process models. IEEE Data Eng. Bull. 32(3), 23\u201328"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Kirchner, K., Markovic, P.: Unveiling hidden patterns in flexible medical treatment processes - A process mining case study. In: ICDSST 2018, vol. 313, pp. 169\u2013180 (2018)","DOI":"10.1007\/978-3-319-90315-6_14"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. In: 50 Years of Integer Programming 1958\u20132008 - From the Early Years to the State-of-the-Art, pp. 29\u201347","DOI":"10.1007\/978-3-540-68279-0_2"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Leemans, S.J.J., Tax, N., ter Hofstede, A.H.M.: Indulpet miner: combining discovery algorithms. In: OTM 2018, vol. 11229, pp. 97\u2013115 (2018)","DOI":"10.1007\/978-3-030-02610-3_6"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Mannhardt, F., de Leoni, M., Reijers, H.A., van der Aalst, W.M.P., Toussaint, P.J.: Guided process discovery - a pattern-based approach. Inf. Syst. 76, 1\u201318","DOI":"10.1016\/j.is.2018.01.009"},{"key":"32_CR14","unstructured":"Mannhardt, F., Tax, N.: Unsupervised event abstraction using pattern abstraction and local process models. In: RADAR+EMISA 2017, vol. 1859, pp. 55\u201363 (2017)"},{"key":"32_CR15","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Peeva, V., Mannel, L.L., van der Aalst, W.M.P.: From place nets to local process models. In: PETRI NETS (2022)","DOI":"10.1007\/978-3-031-06653-5_18"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Pijnenborg, P., Verhoeven, R., Firat, M., Laarhoven, H.V., Genga, L.: Towards evidence-based analysis of palliative treatments for stomach and esophageal cancer patients: a process mining approach. In: ICPM 2021, pp. 136\u2013143 (2021)","DOI":"10.1109\/ICPM53251.2021.9576880"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Schoknecht, A., Thaler, T., Fettke, P., Oberweis, A., Laue, R.: Similarity of business process models - a state-of-the-art analysis. ACM Comput. Surv. 50(4), 52:1\u201352:33","DOI":"10.1145\/3092694"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Tax, N., Sidorova, N., Haakma, R., van der Aalst, W.M.P.: Mining local process models. J. Innov. Digit. Ecosyst. 3(2), 183\u2013196","DOI":"10.1016\/j.jides.2016.11.001"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Thaler, T., Schoknecht, A., Fettke, P., Oberweis, A., Laue, R.: A comparative analysis of business process model similarity measures. In: BPM 2016 International Workshops, vol. 281, pp. 310\u2013322 (2016)","DOI":"10.1007\/978-3-319-58457-7_23"}],"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-56107-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T12:05:44Z","timestamp":1712923544000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56107-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031561061","9783031561078"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56107-8_32","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"13 April 2024","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":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icpm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icpmconference.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.82","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15 sub-reviewers supported the PC members under their invitation","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}