{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T08:45:08Z","timestamp":1768812308311,"version":"3.49.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"National Key R&D Program of China","award":["2017YFE0117500"],"award-info":[{"award-number":["2017YFE0117500"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61762002"],"award-info":[{"award-number":["61762002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2939565","type":"journal-article","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T15:57:31Z","timestamp":1567785451000},"page":"131681-131691","source":"Crossref","is-referenced-by-count":8,"title":["A Self-Adaptive Process Mining Algorithm Based on Information Entropy to Deal With Uncertain Data"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9803-2745","authenticated-orcid":false,"given":"Weimin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuting","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minjun","family":"Xin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hao","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1325-4275","authenticated-orcid":false,"given":"Qun","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.procir.2019.02.116"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.09.011"},{"key":"ref30","first-page":"352","author":"van der aalst","year":"2011","journal-title":"Process Mining Discovery Conformance and Enhancement of Business Processes"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44895-0_10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.47"},{"key":"ref12","first-page":"109","article-title":"Mining invisible tasks in non-free-choice constructs","author":"guo","year":"2016","journal-title":"Proc Int Conf Bus Process Manage"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10844-007-0052-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.03.064"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07734-5_6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2426181"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9236(02)00008-8"},{"key":"ref18","first-page":"30","article-title":"Model discovery of parallel business processes using modified heuristic miner","author":"sarnom","year":"2015","journal-title":"Proc 2nd Int Conf Sci Inf Technol (ICSITech)"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36182-0_37"},{"key":"ref28","year":"0","journal-title":"Hospital Billing&#x2014;Event Log"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2010.06.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2007.07.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-007-0065-y"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CIDM.2011.5949453"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.013"},{"key":"ref5","volume":"166","author":"weijters","year":"2006","journal-title":"Process mining with the HeuristicsMiner algorithm"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0101003"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/225014.225021"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39964-3_25"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.compind.2003.10.004"},{"key":"ref1","volume":"113","author":"de medeiros","year":"2004","journal-title":"Process Mining Extending the ?-Algorithm to Mine Short Loops"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2015.08.003"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-21640-4_30"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2015.07.004"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/291252.288214"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15618-2_17"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0734-189X(85)90125-2"},{"key":"ref25","first-page":"283","article-title":"Process mining: Discovering workflow models from event-based data","author":"weijters","year":"2001","journal-title":"Proc 13th Belgium-Dutch Conf Artif Intell (BNAIC)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08826260.pdf?arnumber=8826260","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:14Z","timestamp":1641987074000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8826260\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2939565","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}