{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T12:13:34Z","timestamp":1762863214115},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T00:00:00Z","timestamp":1673568000000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2023,5]]},"DOI":"10.1007\/s10115-022-01821-2","type":"journal-article","created":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:02:30Z","timestamp":1673575350000},"page":"2087-2121","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An integer linear programming model to improve the dependency graph discovery step of heuristics miner methods"],"prefix":"10.1007","volume":"65","author":[{"given":"Maryam","family":"Tavakoli-Zaniani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Reza","family":"Gholamian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Alireza Hashemi","family":"Golpayegani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehdi","family":"Ghazanfari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"1821_CR1","doi-asserted-by":"publisher","unstructured":"Garcia CdS et al (2019) Process mining techniques and applications\u2014A systematic mapping study. Expert Syst Appl 133:260\u2013295. https:\/\/doi.org\/10.1016\/j.eswa.2019.05.003","DOI":"10.1016\/j.eswa.2019.05.003"},{"key":"1821_CR2","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/j.jbi.2016.04.007","volume":"61","author":"E Rojas","year":"2016","unstructured":"Rojas E, Munoz-Gama J, Sep\u00falveda M, Capurro D (2016) Process mining in healthcare: a literature review. J Biomed Inf 61:224\u2013236. https:\/\/doi.org\/10.1016\/j.jbi.2016.04.007","journal-title":"J Biomed Inf"},{"key":"1821_CR3","unstructured":"Weijters A, Aalst WMP, Medeiros A(2006) Process mining with the Heuristics Miner-algorithm. BETA working papers, vol 166. Technische Universiteit Eindhoven"},{"key":"1821_CR4","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2014.6900341","author":"A Burattin","year":"2012","unstructured":"Burattin A, Sperduti A, Aalst WMP (2012) Heuristics Miners for streaming event data. Comput Res Reposit. https:\/\/doi.org\/10.1109\/CEC.2014.6900341","journal-title":"Comput Res Reposit"},{"key":"1821_CR5","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-319-17482-2_11","volume-title":"Process mining techniques in business environments: theoretical aspects, algorithms, techniques and open challenges in process mining","author":"A Burattin","year":"2015","unstructured":"Burattin A (2015) Heuristics Miner for time interval. In: Burattin A (ed) Process mining techniques in business environments: theoretical aspects, algorithms, techniques and open challenges in process mining. Springer, Cham, pp 85\u201395"},{"key":"1821_CR6","doi-asserted-by":"publisher","unstructured":"Weijters AJMM, Ribeiro JTS (2011) Flexible heuristics miner (FHM). In: 2011 IEEE symposium on computational intelligence and data mining (CIDM). IEEE, pp 310\u2013317. https:\/\/doi.org\/10.1109\/CIDM.2011.5949453","DOI":"10.1109\/CIDM.2011.5949453"},{"key":"1821_CR7","doi-asserted-by":"publisher","unstructured":"vanden Broucke SKLM, De Weerdt J (2017) Fodina: a robust and flexible heuristic process discovery technique. Decis Support Syst 100:109\u2013118. https:\/\/doi.org\/10.1016\/j.dss.2017.04.005","DOI":"10.1016\/j.dss.2017.04.005"},{"key":"1821_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process mining: discovery, conformance and enhancement of business processes","author":"WMP van der Aalst","year":"2011","unstructured":"van der Aalst WMP (2011) Process mining: discovery, conformance and enhancement of business processes. Springer, Berlin, Heidelberg"},{"key":"1821_CR9","unstructured":"Prodel M (2017) Process discovery, analysis and simulation of clinical pathways using health-care data. PhD dissertation, \u00c9cole Nationale Sup\u00e9rieure des Mines de Saint-\u00c9tienne Sp\u00e9cialit\u00e9 : G\u00e9nie Industriel"},{"key":"1821_CR10","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.cie.2016.05.010","volume":"99","author":"BN Yahya","year":"2016","unstructured":"Yahya BN, Song M, Bae H, Sul S-O, Wu J-Z (2016) Domain-driven actionable process model discovery. Comput Ind Eng 99:382\u2013400. https:\/\/doi.org\/10.1016\/j.cie.2016.05.010","journal-title":"Comput Ind Eng"},{"issue":"3","key":"1821_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s10489-016-0779-x","volume":"46","author":"SK Das","year":"2017","unstructured":"Das SK, Mandal T, Edalatpanah SA (2017) A mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers. Appl Intell 46(3):509\u2013519. https:\/\/doi.org\/10.1007\/s10489-016-0779-x","journal-title":"Appl Intell"},{"issue":"2","key":"1821_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.54216\/IJNS.040202","volume":"4","author":"SK Das","year":"2020","unstructured":"Das SK, Dash JK (2020) A new ranking function of triangular neutrosophic number and its application in integer programming. Int J Neutrosophic Sci 4(2):82\u201392","journal-title":"Int J Neutrosophic Sci"},{"issue":"2","key":"1821_CR13","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1016\/j.apm.2010.07.037","volume":"35","author":"A Kumar","year":"2011","unstructured":"Kumar A, Kaur J, Singh P (2011) A new method for solving fully fuzzy linear programming problems. Appl Math Model 35(2):817\u2013823. https:\/\/doi.org\/10.1016\/j.apm.2010.07.037","journal-title":"Appl Math Model"},{"issue":"12","key":"1821_CR14","doi-asserted-by":"publisher","first-page":"3183","DOI":"10.1016\/j.apm.2013.03.014","volume":"39","author":"R Ezzati","year":"2015","unstructured":"Ezzati R, Khorram E, Enayati R (2015) A new algorithm to solve fully fuzzy linear programming problems using the MOLP problem. Appl Math Model 39(12):3183\u20133193. https:\/\/doi.org\/10.1016\/j.apm.2013.03.014","journal-title":"Appl Math Model"},{"issue":"5","key":"1821_CR15","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s00607-017-0582-5","volume":"100","author":"SJ van Zelst","year":"2018","unstructured":"van Zelst SJ, van Dongen BF, van der Aalst WMP, Verbeek HMW (2018) Discovering workflow nets using integer linear programming. Computing 100(5):529\u2013556. https:\/\/doi.org\/10.1007\/s00607-017-0582-5","journal-title":"Computing"},{"key":"1821_CR16","doi-asserted-by":"publisher","unstructured":"van der Werf JMEM, van Dongen BF, Hurkens CAJ, Serebrenik A (2008) Process discovery using integer linear programming. In: van Hee KM, Valk R (eds) Applications and theory of petri nets, pp 368\u2013387. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-540-68746-7_24","DOI":"10.1007\/978-3-540-68746-7_24"},{"key":"1821_CR17","volume-title":"Algorithms & theories for the analysis of event dData (ATAED\u201915, Brussels, Belgium, June 22\u201323, 2015, pp 47\u201361","author":"SJ van Zelst","year":"2015","unstructured":"van Zelst SJ, van Dongen BF, Aalst WMP (2015) ILP-based process discovery using hybrid regions. In: van der Aalst WMP, Bergenthum R, Carmona J (eds) Algorithms & theories for the analysis of event dData (ATAED\u201915, Brussels, Belgium, June 22\u201323, 2015, pp 47\u201361. CEUR-WS.org, Aachen"},{"issue":"3","key":"1821_CR18","doi-asserted-by":"publisher","first-page":"1309","DOI":"10.1109\/TASE.2017.2784436","volume":"15","author":"M Prodel","year":"2018","unstructured":"Prodel M, Augusto V, Jouaneton B, Lamarsalle L, Xie X (2018) Optimal process mining for large and complex event logs. IEEE Trans Autom Sci Eng 15(3):1309\u20131325. https:\/\/doi.org\/10.1109\/TASE.2017.2784436","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"1821_CR19","doi-asserted-by":"publisher","unstructured":"Prodel M, Augusto V, Xie X, Jouaneton B, Lamarsalle L (2015) Discovery of patient pathways from a national hospital database using process mining and integer linear programming. In: Proceedings of IEEE international conference on automation science and engineering (CASE). IEEE, pp 1409\u20131414. https:\/\/doi.org\/10.1109\/CoASE.2015.7294295","DOI":"10.1109\/CoASE.2015.7294295"},{"key":"1821_CR20","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1109\/ACCESS.2021.3135298","volume":"10","author":"M Tavakoli-Zaniani","year":"2022","unstructured":"Tavakoli-Zaniani M, Gholamian MR (2022) Improving heuristic process discovery methods through determining the optimal split\/join patterns of dependency graphs. IEEE Access 10:1116\u20131131. https:\/\/doi.org\/10.1109\/ACCESS.2021.3135298","journal-title":"IEEE Access"},{"key":"1821_CR21","doi-asserted-by":"publisher","unstructured":"Leemans SJJ, Poppe E, Wynn MT (2019) Directly follows-based process mining: exploration & a case study. In: Proceeding of international conference on process mining (ICPM). IEEE, pp 25\u201332. https:\/\/doi.org\/10.1109\/ICPM.2019.00015","DOI":"10.1109\/ICPM.2019.00015"},{"issue":"3","key":"1821_CR22","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1007\/s10115-019-01376-9","volume":"62","author":"SJJ Leemans","year":"2020","unstructured":"Leemans SJJ, Fahland D (2020) Information-preserving abstractions of event data in process mining. Knowl Inf Syst 62(3):1143\u20131197. https:\/\/doi.org\/10.1007\/s10115-019-01376-9","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1821_CR23","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10115-018-1214-x","volume":"59","author":"A Augusto","year":"2019","unstructured":"Augusto A, Conforti R, Dumas M, La Rosa M, Polyvyanyy A (2019) Split miner: automated discovery of accurate and simple business process models from event logs. Knowl Inf Syst 59(2):251\u2013284. https:\/\/doi.org\/10.1007\/s10115-018-1214-x","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1821_CR24","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1109\/TKDE.2016.2614680","volume":"29","author":"R Conforti","year":"2017","unstructured":"Conforti R, Rosa ML, Hofstede AHMT (2017) Filtering out infrequent behavior from business process event logs. IEEE Trans Knowl Data Eng 29(2):300\u2013314. https:\/\/doi.org\/10.1109\/TKDE.2016.2614680","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1821_CR25","unstructured":"Alves de Medeiros A (2006) Genetic process mining. PhD dissertation, Beta Research School for Operations Management and Logistics, TU Eindhoven"},{"issue":"1","key":"1821_CR26","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.is.2007.07.001","volume":"33","author":"A Rozinat","year":"2008","unstructured":"Rozinat A, van der Aalst WMP (2008) Conformance checking of processes based on monitoring real behavior. Inf Syst 33(1):64\u201395. https:\/\/doi.org\/10.1016\/j.is.2007.07.001","journal-title":"Inf Syst"},{"issue":"2","key":"1821_CR27","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1002\/widm.1045","volume":"2","author":"WMP van der Aalst","year":"2012","unstructured":"van der Aalst WMP, Adriansyah A, van Dongen B (2012) Replaying history on process models for conformance checking and performance analysis. Wiley Interdiscip Rev Data Min Knowl Discov 2(2):182\u2013192","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"1821_CR28","doi-asserted-by":"crossref","unstructured":"Adriansyah A, van Dongen B, van der Aalst WMP (2011) Conformance checking using cost-based fitness analysis. In: 15th IEEE international enterprise distributed object computing conference (EDOC). IEEE, pp 55\u201364","DOI":"10.1109\/EDOC.2011.12"},{"key":"1821_CR29","doi-asserted-by":"publisher","unstructured":"Adriansyah A (2014) Aligning observed and modeled behavior. PhD dissertation, Department of Mathematics and Computer Science,TU Eindhoven. https:\/\/doi.org\/10.6100\/IR770080","DOI":"10.6100\/IR770080"},{"issue":"1","key":"1821_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10257-014-0234-7","volume":"13","author":"A Adriansyah","year":"2015","unstructured":"Adriansyah A, Munoz-Gama J, Carmona J, van Dongen B, van der Aalst WMP (2015) Measuring precision of modeled behavior. Inf Syst E-Bus Manag 13(1):37\u201367","journal-title":"Inf Syst E-Bus Manag"},{"issue":"1","key":"1821_CR31","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S Warshall","year":"1962","unstructured":"Warshall S (1962) A Theorem on boolean matrices. J ACM 9(1):11\u201312. https:\/\/doi.org\/10.1145\/321105.321107","journal-title":"J ACM"},{"key":"1821_CR32","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.datak.2018.04.007","volume":"117","author":"A Augusto","year":"2018","unstructured":"Augusto A, Conforti R, Dumas M, La Rosa M, Bruno G (2018) Automated discovery of structured process models from event logs: the discover-and-structure approach. Data Knowl Eng 117:373\u2013392. https:\/\/doi.org\/10.1016\/j.datak.2018.04.007","journal-title":"Data Knowl Eng"},{"key":"1821_CR33","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.is.2019.05.002","volume":"84","author":"H Nguyen","year":"2019","unstructured":"Nguyen H, Dumas M, ter Hofstede AHM, La Rosa M, Maggi FM (2019) Stage-based discovery of business process models from event logs. Inf Syst 84:214\u2013237. https:\/\/doi.org\/10.1016\/j.is.2019.05.002","journal-title":"Inf Syst"},{"issue":"4","key":"1821_CR34","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TKDE.2018.2841877","volume":"31","author":"A Augusto","year":"2018","unstructured":"Augusto A et al (2018) Automated discovery of process models from event logs: review and benchmark. EEE Trans Knowl Data Eng 31(4):686\u2013705. https:\/\/doi.org\/10.1109\/TKDE.2018.2841877","journal-title":"EEE Trans Knowl Data Eng"},{"key":"1821_CR35","doi-asserted-by":"publisher","unstructured":"Levy D (2014) Production analysis with process mining technology. Distributed by 4TU.ResearchData. Dataset. https:\/\/doi.org\/10.4121\/uuid:68726926-5ac5-4fab-b873-ee76ea412399","DOI":"10.4121\/uuid:68726926-5ac5-4fab-b873-ee76ea412399"},{"key":"1821_CR36","doi-asserted-by":"publisher","unstructured":"Joos B (2014) Receipt phase of an environmental permit application process (WABO), CoSeLoG project. Distributed by 4TU.ResearchData. Dataset. https:\/\/doi.org\/10.4121\/uuid:a07386a5-7be3-4367-9535-70bc9e77dbe6","DOI":"10.4121\/uuid:a07386a5-7be3-4367-9535-70bc9e77dbe6"},{"key":"1821_CR37","doi-asserted-by":"publisher","unstructured":"Shugurov I, Mitsyuk A (2014) Generation of a set of event logs with noise. In: Kamkin A, Petrenko A, Trekhov A (eds) 8th Spring\/Summer Young Researchers\u2019 Colloquium on Software Engineering (SYRCoSE2014). ISP Ros, pp 88\u201395. https:\/\/doi.org\/10.15514\/SYRCOSE-2014-8-13","DOI":"10.15514\/SYRCOSE-2014-8-13"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01821-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-022-01821-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-022-01821-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,5]],"date-time":"2023-04-05T10:12:15Z","timestamp":1680689535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-022-01821-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,13]]},"references-count":37,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,5]]}},"alternative-id":["1821"],"URL":"https:\/\/doi.org\/10.1007\/s10115-022-01821-2","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,13]]},"assertion":[{"value":"3 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors did not receive support from any organization for the submitted work. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}