检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:CAO Rui ZENG Qingtian NI Weijian LU Faming LIU Cong DUAN Hua
机构地区:[1]College of Computer Science and Engineering,Shandong University of Science and Technology,Qingdao 266510,China [2]School of Computer Science and Technology,Shandong University of Technology,Zibo 255000,China
出 处:《Chinese Journal of Electronics》2023年第3期625-639,共15页电子学报(英文版)
基 金:supported by the National Natural Science Foundation of China(U1931207,61702306);Sci.&Tech.Development Fund of Shandong Province of China(ZR2017BF015,ZR2017MF027);the Humanities and Social Science Research Project of the Ministry of Education(18YJAZH017);Shandong Chongqing Science and Technology Cooperation Project(cstc2020jscx-lyjsAX0008);Sci.&Tech.Development Fund of Qingdao(21-1-5-zlyj-1-zc);the Shandong Postgraduate Education Quality Improvement Plan(SDYJG19075);Shandong Education Teaching Research Key Project(2021JXZ010);National Statistical Science Research Project(2021LY053);the Taishan Scholar Program of Shandong Province,SDUST Research Fund(2015TDJH102,2019KJN024);National Statistical Science Research Project in 2019(2019LY49).
摘 要:With the recent advances in the field of deep learning,an increasing number of deep neural networks have been applied to business process prediction tasks,remaining time prediction,to obtain more accurate predictive results.However,existing time prediction methods based on deep learning have poor interpretability,an explainable business process remaining time prediction method is proposed using reachability graph,which consists of prediction model construction and visualization.For prediction models,a Petri net is mined and the reachability graph is constructed to obtain the transition occurrence vector.Then,prefixes and corresponding suffixes are generated to cluster into different transition partitions according to transition occurrence vector.Next,the bidirectional recurrent neural network with attention is applied to each transition partition to encode the prefixes,and the deep transfer learning between different transition partitions is performed.For the visualization of prediction models,the evaluation values are added to the sub-processes of a Petri net to realize the visualization of the prediction models.Finally,the proposed method is validated by publicly available event logs.
关 键 词:Explainable predictive process monitoring Remaining time prediction Reachability graph Recurrent neural network Petri net.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.237