工作流挖掘中的隐式问题研究

Hu Zhao-wei
{"title":"工作流挖掘中的隐式问题研究","authors":"Hu Zhao-wei","doi":"10.1109/icams.2010.5552956","DOIUrl":null,"url":null,"abstract":"This paper analyzes the problems of implicit places and implicit transitions.In view of the shortage of a algoritm to resolve the implicit problems,a+~* algorithm is presented.In this algorithm,the implicit tasks are marked in another style,the model are constructed by the dependency of the tasks.It uses CPN Tools to general log files and mines the logs by ProM and a+~* algorithm.The simulation results validate the efficiency of the algorithm.","PeriodicalId":64641,"journal":{"name":"计算机工程","volume":"50 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/icams.2010.5552956","citationCount":"0","resultStr":"{\"title\":\"Research of Implicit Problems in Workflow Mining\",\"authors\":\"Hu Zhao-wei\",\"doi\":\"10.1109/icams.2010.5552956\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper analyzes the problems of implicit places and implicit transitions.In view of the shortage of a algoritm to resolve the implicit problems,a+~* algorithm is presented.In this algorithm,the implicit tasks are marked in another style,the model are constructed by the dependency of the tasks.It uses CPN Tools to general log files and mines the logs by ProM and a+~* algorithm.The simulation results validate the efficiency of the algorithm.\",\"PeriodicalId\":64641,\"journal\":{\"name\":\"计算机工程\",\"volume\":\"50 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1109/icams.2010.5552956\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"计算机工程\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.1109/icams.2010.5552956\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"计算机工程","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.1109/icams.2010.5552956","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文分析了隐式位置和隐式转换问题。针对目前求解隐式问题算法的不足,提出了一种+~*算法。该算法采用另一种方式对隐式任务进行标记,通过任务之间的依赖关系来构造模型。采用CPN工具对日志文件进行通用化处理,并采用ProM和a+~*算法对日志进行挖掘。仿真结果验证了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Research of Implicit Problems in Workflow Mining
This paper analyzes the problems of implicit places and implicit transitions.In view of the shortage of a algoritm to resolve the implicit problems,a+~* algorithm is presented.In this algorithm,the implicit tasks are marked in another style,the model are constructed by the dependency of the tasks.It uses CPN Tools to general log files and mines the logs by ProM and a+~* algorithm.The simulation results validate the efficiency of the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.50
自引率
0.00%
发文量
34789
期刊介绍:
期刊最新文献
Survey of swarm intelligence Crosstalk Elimination Method Based on Chaotic Binary Amplitude Shift Keying A Study on Message Queue Safe Proper Time for AI Open API Fintech Architecture A Study on the Psychological Resistance Factors Regarding Internet Banks Towards Multiple-Hardware-in-the-Loop Simulation for Testing Heterogeneous Cyber-Physical Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1