Show simple item record

dc.contributor.authorLi, Weimin
dc.contributor.authorFan, Yuting
dc.contributor.authorLiu, Wei
dc.contributor.authorXin, Minjun
dc.contributor.authorWang, Hao
dc.contributor.authorJin, Qun
dc.date.accessioned2019-09-24T07:10:01Z
dc.date.available2019-09-24T07:10:01Z
dc.date.created2019-09-21T14:35:14Z
dc.date.issued2019
dc.identifier.citationIEEE Access. 2019, .nb_NO
dc.identifier.issn2169-3536
dc.identifier.urihttp://hdl.handle.net/11250/2618349
dc.description.abstractProcess mining is a technology to gain knowledge of the business process by using the event logs and achieve a model of the process, which contributes to the detection and improvement of the business process. However, most existing process mining algorithms have drawbacks associated with managing uncertain data, and the method of using the frequency threshold alone needs to be enhanced. This paper improves correlation measures in heuristic mining to build a correlation matrix based on an improved frequency matrix. Combined with the maximum entropy principle, a self-adaptive method to determine the threshold is given, which is used to remove the uncertain data relationship in the logs. Furthermore, this study identifies a selective and parallel structure through a modified frequency matrix, and we can get a Petri net-based process model from a directed graph. The recognition of parallel structures contributes to eliminating imbalances when calculating the threshold to deal with the uncertain data. Finally, this paper presents an algorithm framework for adaptively removing uncertain data. This study represents a new attempt to use entropy to remove uncertain data in the field of Business Process Management (BPM). The threshold to deal with the uncertain data does not need to set the parameters in advance. Therefore, the proposed algorithm is self-adaptive and universal. Experimental results show that the algorithm proposed in this study has a higher degree of behavioral and structural appropriateness, and fitness, for the uncertain log data compared to traditional algorithms.nb_NO
dc.language.isoengnb_NO
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)nb_NO
dc.rightsNavngivelse 4.0 Internasjonal*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/deed.no*
dc.titleA Self-Adaptive Process Mining Algorithm Based on Information Entropy to Deal with Uncertain Datanb_NO
dc.typeJournal articlenb_NO
dc.typePeer reviewednb_NO
dc.description.versionacceptedVersionnb_NO
dc.source.pagenumber11nb_NO
dc.source.journalIEEE Accessnb_NO
dc.identifier.doi10.1109/ACCESS.2019.2939565
dc.identifier.cristin1727469
dc.description.localcodeThis work is licensed under a Creative Commons Attribution 4.0 License. For more information, see http://creativecommons.org/licenses/by/4.0/nb_NO
cristin.unitcode194,63,10,0
cristin.unitnameInstitutt for datateknologi og informatikk
cristin.ispublishedfalse
cristin.fulltextpostprint
cristin.qualitycode1


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Navngivelse 4.0 Internasjonal
Except where otherwise noted, this item's license is described as Navngivelse 4.0 Internasjonal