{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:03:50Z","timestamp":1757617430809,"version":"3.44.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031813740"},{"type":"electronic","value":"9783031813757"}],"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:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-81375-7_25","type":"book-chapter","created":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T03:16:09Z","timestamp":1739416569000},"page":"382-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Discovering Order-Inducing Features in\u00a0Event Knowledge Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7998-7167","authenticated-orcid":false,"given":"Christoffer Olling","family":"Back","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3488-9392","authenticated-orcid":false,"given":"Jakob Grue","family":"Simonsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,14]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Adams, J.N., Schuster, D., Schmitz, S., Schuh, G., van\u00a0der Aalst, W.: Defining cases and variants for object-centric event data. In: ICPM, pp. 128\u201335. IEEE (2022)","DOI":"10.1109\/ICPM57379.2022.9980730"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Back, C.O., Manataki, A., Papanastasiou, A., Harrison, E.: Stochastic workflow modeling in a surgical ward: towards simulating and predicting patient flow. In: Biomedical Engineering Systems and Tech, pp. 565\u2013591. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-72379-8_28"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Back, C.O., Simonsen, J.G.: Posets and bounded probabilities for discovering order-inducing features in event knowledge graphs. arXiv:2410.06065 (2024)","DOI":"10.1007\/978-3-031-81375-7_25"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jda.2018.04.001","volume":"51","author":"J Banks","year":"2018","unstructured":"Banks, J., Garrabrant, S.M., Huber, M.L., Perizzolo, A.: Using tpa to count linear extensions. J. Discrete Algorithms 51, 1\u201311 (2018)","journal-title":"J. Discrete Algorithms"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Berti, A., Park, G., Rafiei, M., Van Der\u00a0Aalst, W.: A generic approach to extract object-centric event data from databases supporting SAP ERP. JIIS (2023)","DOI":"10.21203\/rs.3.rs-2475402\/v1"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF00383444","volume":"8","author":"G Brightwell","year":"1991","unstructured":"Brightwell, G., Winkler, P.: Counting linear extensions. Order 8(3), 225\u2013242 (1991)","journal-title":"Order"},{"issue":"3","key":"25_CR7","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1016\/0095-8956(72)90064-0","volume":"13","author":"KKH Butler","year":"1972","unstructured":"Butler, K.K.H.: The number of partially ordered sets. JCTB 13(3), 276\u2013289 (1972)","journal-title":"JCTB"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Chen, X.w.: An improved branch and bound algorithm for feature selection. Pattern Recogn. Lett. 24(12), 1925\u20131933 (2003)","DOI":"10.1016\/S0167-8655(03)00020-5"},{"issue":"1","key":"25_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1093\/biomet\/59.1.131","volume":"59","author":"JS Decani","year":"1972","unstructured":"Decani, J.S.: A branch and bound algorithm for maximum likelihood paired comparison ranking. Biometrika 59(1), 131\u2013135 (1972)","journal-title":"Biometrika"},{"issue":"3","key":"25_CR10","first-page":"e1346","volume":"10","author":"K Diba","year":"2020","unstructured":"Diba, K., Batoulis, K., Weidlich, M., Weske, M.: Extraction, correlation, and abstraction of event data for process mining. WIREs DMKD 10(3), e1346 (2020)","journal-title":"WIREs DMKD"},{"key":"25_CR11","unstructured":"van Dongen, B.: Bpi challenge 2017 event log (2017)"},{"key":"25_CR12","doi-asserted-by":"publisher","unstructured":"Esser, S., Fahland, D.: Multi-dimensional event data in graph databases. J. Data Seman. 109\u2013141 (2021). https:\/\/doi.org\/10.1007\/s13740-021-00122-1","DOI":"10.1007\/s13740-021-00122-1"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Fahland, D.: Process mining over multiple behavioral dimensions with event knowledge graphs. In: Process Mining Handbook, pp. 274\u2013319. Springer (2022)","DOI":"10.1007\/978-3-031-08848-3_9"},{"key":"25_CR14","unstructured":"MacKay, D.J.: Information theory, inference and learning algorithms. CUP (2003)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Mannila, H., Meek, C.: Global partial orders from sequential data. In: Proceedings of the 6th ACM International Conference on Knowledge Discovery and Data Mining, pp. 161\u201368. ACM, Boston (2000)","DOI":"10.1145\/347090.347122"},{"issue":"3","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/080715822","volume":"23","author":"J Morton","year":"2009","unstructured":"Morton, J., Pachter, L., Shiu, A., Sturmfels, B., Wienand, O.: Convex rank tests and semigraphoids. SIAM J. Discrete Math. 23(3), 1117\u20131134 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1613\/jair.5128","volume":"57","author":"C Muise","year":"2016","unstructured":"Muise, C., Beck, J.C., McIlraith, S.A.: Optimal partial-order plan relaxation via MaxSAT. J. Artif. Intell. Res. 57, 113\u2013149 (2016)","journal-title":"J. Artif. Intell. Res."},{"issue":"12","key":"25_CR18","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1016\/j.patrec.2007.02.015","volume":"28","author":"S Nakariyakul","year":"2007","unstructured":"Nakariyakul, S., Casasent, D.P.: Adaptive branch and bound algorithm for selecting optimal features. Pattern Recogn. Lett. 28(12), 1415\u20131427 (2007)","journal-title":"Pattern Recogn. Lett."},{"issue":"57","key":"25_CR19","first-page":"1","volume":"17","author":"T Niinim\u00e4ki","year":"2016","unstructured":"Niinim\u00e4ki, T., Parviainen, P., Koivisto, M.: Structure discovery in Bayesian networks by sampling partial orders. J. Mach. Learn. Res. 17(57), 1\u201347 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Robinson, R.W.: Counting unlabeled acyclic digraphs, pp. 28\u201343 (1977)","DOI":"10.1007\/BFb0069178"},{"issue":"5","key":"25_CR21","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1109\/TKDE.2010.156","volume":"23","author":"N Thakoor","year":"2011","unstructured":"Thakoor, N., Gao, J.: Branch-and-bound for model selection and its computational complexity. IEEE Trans. Knowl. Data Eng. 23(5), 655\u2013668 (2011)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Cooperative Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-81375-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T05:01:01Z","timestamp":1757134861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-81375-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031813740","9783031813757"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-81375-7_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"14 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CoopIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cooperative Information Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"20 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coopis2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/coopis.scitevents.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}