{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T00:54:24Z","timestamp":1781398464782,"version":"3.54.1"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030791070","type":"print"},{"value":"9783030791087","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-79108-7_14","type":"book-chapter","created":{"date-parts":[[2021,6,14]],"date-time":"2021-06-14T10:02:48Z","timestamp":1623664968000},"page":"118-126","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Tool for Computing Probabilistic Trace Alignments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1844-0851","authenticated-orcid":false,"given":"Giacomo","family":"Bergami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9089-6896","authenticated-orcid":false,"given":"Fabrizio Maria","family":"Maggi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8021-3430","authenticated-orcid":false,"given":"Marco","family":"Montali","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2693-5790","authenticated-orcid":false,"given":"Rafael","family":"Pe\u00f1aloza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,15]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Adriansyah, A., van Dongen, B.F., van der Aalst, W.M.P.: Conformance checking using cost-based fitness analysis. In: EDOC 2011, pp. 55\u201364. IEEE (2011)","DOI":"10.1109\/EDOC.2011.12"},{"issue":"3","key":"14_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1080\/00031305.1992.10475879","volume":"46","author":"NS Altman","year":"1992","unstructured":"Altman, N.S.: An introduction to kernel and nearest-neighbor nonparametric regression. Am. Stat. 46(3), 175\u2013185 (1992)","journal-title":"Am. Stat."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Bergami, G., Bertini, F., Montesi, D.: Hierarchical embedding for DAG reachability queries. In: IDEAS, pp. 24:1\u201324:10. ACM (2020)","DOI":"10.1145\/3410566.3410583"},{"issue":"1\u20133","key":"14_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10994-006-8258-y","volume":"64","author":"K Driessens","year":"2006","unstructured":"Driessens, K., Ramon, J., G\u00e4rtner, T.: Graph kernels and gaussian processes for relational reinforcement learning. Mach. Learn. 64(1\u20133), 91\u2013119 (2006). https:\/\/doi.org\/10.1007\/s10994-006-8258-y","journal-title":"Mach. Learn."},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/959242.959248","volume":"5","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T.: A survey of kernels for structured data. SIGKDD 5(1), 49\u201358 (2003)","journal-title":"SIGKDD"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-540-45167-9_11","volume-title":"Learning Theory and Kernel Machines","author":"T G\u00e4rtner","year":"2003","unstructured":"G\u00e4rtner, T., Flach, P., Wrobel, S.: On graph kernels: hardness results and efficient alternatives. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT-Kernel 2003. LNCS (LNAI), vol. 2777, pp. 129\u2013143. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45167-9_11"},{"key":"14_CR7","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-030-26643-1_8","volume-title":"Business Process Management Forum","author":"SJJ Leemans","year":"2019","unstructured":"Leemans, S.J.J., Syring, A.F., van der Aalst, W.M.P.: Earth movers\u2019 stochastic conformance checking. In: Hildebrandt, T., van Dongen, B.F., R\u00f6glinger, M., Mendling, J. (eds.) BPM 2019. LNBIP, vol. 360, pp. 127\u2013143. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26643-1_8"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.eswa.2017.03.047","volume":"82","author":"M de Leoni","year":"2017","unstructured":"de Leoni, M., Marrella, A.: Aligning real process executions and prescriptive process models through automated planning. Expert Syst. Appl. 82, 162\u2013183 (2017)","journal-title":"Expert Syst. Appl."},{"key":"14_CR9","first-page":"419","volume":"2","author":"H Lodhi","year":"2002","unstructured":"Lodhi, H., Saunders, C., Shawe-Taylor, J., Cristianini, N., Watkins, C.J.C.H.: Text classification using string kernels. J. Mach. Learn. Res. 2, 419\u2013444 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Kalenkova, A.A.: Monotone conformance checking for partially matching designed and observed processes. In: ICPM, pp. 81\u201388 (2019)","DOI":"10.1109\/ICPM.2019.00022"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Polyvyanyy, A., Solti, A., Weidlich, M., Di Ciccio, C., Mendling, J.: Monotone precision and recall measures for comparing executions and specifications of dynamic systems. ACM Trans. Softw. Eng. Methodol. 29(3), 17:1\u201317:41 (2020)","DOI":"10.1145\/3387909"},{"issue":"11","key":"14_CR12","doi-asserted-by":"publisher","first-page":"5631","DOI":"10.1073\/pnas.1911030117","volume":"117","author":"C Seshadhri","year":"2020","unstructured":"Seshadhri, C., Sharma, A., Stolman, A., Goel, A.: The impossibility of low-rank representations for triangle-rich complex networks. Proc. Natl. Acad. Sci. 117(11), 5631\u20135637 (2020)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Business Information Processing","Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-79108-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T00:03:03Z","timestamp":1781395383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-79108-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030791070","9783030791087"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-79108-7_14","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"value":"1865-1348","type":"print"},{"value":"1865-1356","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"15 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAiSE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Information Systems Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caise2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caise21.org\/","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":"33","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":"0","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":"0","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":"0% - 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":"6","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":"In addition, 18 contributions were accepted for the CAiSE 2021 Forum, and 15 papers from the Workshops. The conference was held online due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}