比较过程挖掘算法的框架

Phil Weber, B. Bordbar, P. Tiňo, B. Majeed
{"title":"比较过程挖掘算法的框架","authors":"Phil Weber, B. Bordbar, P. Tiňo, B. Majeed","doi":"10.1109/IEEEGCC.2011.5752616","DOIUrl":null,"url":null,"abstract":"There are many process mining algorithms with different theoretical foundations and aims, raising the question of how to choose the best for a particular situation. A framework is proposed for objectively comparing algorithms for process discovery against a known ground truth, with an implementation using existing tools. Results from an experimental evaluation of five algorithms against basic process structures confirm the validity of the approach. In general, numbers of traces for mining are predictable from the structure and probabilities in the model, but there are some algorithm-specific differences.","PeriodicalId":119104,"journal":{"name":"2011 IEEE GCC Conference and Exhibition (GCC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":"{\"title\":\"A framework for comparing process mining algorithms\",\"authors\":\"Phil Weber, B. Bordbar, P. Tiňo, B. Majeed\",\"doi\":\"10.1109/IEEEGCC.2011.5752616\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are many process mining algorithms with different theoretical foundations and aims, raising the question of how to choose the best for a particular situation. A framework is proposed for objectively comparing algorithms for process discovery against a known ground truth, with an implementation using existing tools. Results from an experimental evaluation of five algorithms against basic process structures confirm the validity of the approach. In general, numbers of traces for mining are predictable from the structure and probabilities in the model, but there are some algorithm-specific differences.\",\"PeriodicalId\":119104,\"journal\":{\"name\":\"2011 IEEE GCC Conference and Exhibition (GCC)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"21\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE GCC Conference and Exhibition (GCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEEGCC.2011.5752616\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE GCC Conference and Exhibition (GCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEEGCC.2011.5752616","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

摘要

有许多具有不同理论基础和目标的过程挖掘算法,提出了如何为特定情况选择最佳算法的问题。提出了一个框架,用于客观地比较过程发现算法与已知基础真理,并使用现有工具实现。针对基本过程结构的五种算法的实验评估结果证实了该方法的有效性。一般来说,从模型的结构和概率可以预测挖掘的轨迹数,但存在一些特定于算法的差异。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A framework for comparing process mining algorithms
There are many process mining algorithms with different theoretical foundations and aims, raising the question of how to choose the best for a particular situation. A framework is proposed for objectively comparing algorithms for process discovery against a known ground truth, with an implementation using existing tools. Results from an experimental evaluation of five algorithms against basic process structures confirm the validity of the approach. In general, numbers of traces for mining are predictable from the structure and probabilities in the model, but there are some algorithm-specific differences.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信