发现业务流程模型的多目标二元差分法与参数调整:MoD-ProM.

Q2 Environmental Science
The Scientific World Journal Pub Date : 2024-08-27 eCollection Date: 2024-01-01 DOI:10.1155/2024/9545184
A Sonia Deshmukh, B Shikha Gupta, C Naveen Kumar
{"title":"发现业务流程模型的多目标二元差分法与参数调整:MoD-ProM.","authors":"A Sonia Deshmukh, B Shikha Gupta, C Naveen Kumar","doi":"10.1155/2024/9545184","DOIUrl":null,"url":null,"abstract":"<p><p>Process discovery approaches analyze the business data to automatically uncover structured information, known as a process model. The quality of a process model is measured using quality dimensions, completeness (replay fitness), preciseness, simplicity, and generalization. Traditional process discovery algorithms usually output a single process model. A single model may not accurately capture the observed behavior and overfit the training data. We have formed the process discovery problem in a multiobjective framework that yields several candidate solutions for the end user who can pick a suitable model based on the local environmental constraints (possibly varying). We consider the Binary Differential Evolution approach in a multiobjective framework for the task of process discovery. The proposed method employs dichotomous crossover/mutation operators. The parameters are tuned using grey relational analysis combined with the Taguchi approach. We have compared the proposed approach with the well-known single-objective algorithms and state-of-the-art multiobjective evolutionary algorithm-Nondominated Sorting Genetic Algorithm (NSGA-II). Additional comparison via computing a weighted average of the quality dimensions is also undertaken. Results show that the proposed algorithm is computationally efficient and produces diversified candidate solutions that score high on the fitness functions. It is shown that the process models generated by the proposed approach are superior to or at least as good as those generated by the state-of-the-art algorithms.</p>","PeriodicalId":22985,"journal":{"name":"The Scientific World Journal","volume":"2024 ","pages":"9545184"},"PeriodicalIF":0.0000,"publicationDate":"2024-08-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11371452/pdf/","citationCount":"0","resultStr":"{\"title\":\"Multiobjective Binary Differential Approach with Parameter Tuning for Discovering Business Process Models: MoD-ProM.\",\"authors\":\"A Sonia Deshmukh, B Shikha Gupta, C Naveen Kumar\",\"doi\":\"10.1155/2024/9545184\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p><p>Process discovery approaches analyze the business data to automatically uncover structured information, known as a process model. The quality of a process model is measured using quality dimensions, completeness (replay fitness), preciseness, simplicity, and generalization. Traditional process discovery algorithms usually output a single process model. A single model may not accurately capture the observed behavior and overfit the training data. We have formed the process discovery problem in a multiobjective framework that yields several candidate solutions for the end user who can pick a suitable model based on the local environmental constraints (possibly varying). We consider the Binary Differential Evolution approach in a multiobjective framework for the task of process discovery. The proposed method employs dichotomous crossover/mutation operators. The parameters are tuned using grey relational analysis combined with the Taguchi approach. We have compared the proposed approach with the well-known single-objective algorithms and state-of-the-art multiobjective evolutionary algorithm-Nondominated Sorting Genetic Algorithm (NSGA-II). Additional comparison via computing a weighted average of the quality dimensions is also undertaken. Results show that the proposed algorithm is computationally efficient and produces diversified candidate solutions that score high on the fitness functions. It is shown that the process models generated by the proposed approach are superior to or at least as good as those generated by the state-of-the-art algorithms.</p>\",\"PeriodicalId\":22985,\"journal\":{\"name\":\"The Scientific World Journal\",\"volume\":\"2024 \",\"pages\":\"9545184\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11371452/pdf/\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Scientific World Journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1155/2024/9545184\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/1/1 0:00:00\",\"PubModel\":\"eCollection\",\"JCR\":\"Q2\",\"JCRName\":\"Environmental Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Scientific World Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2024/9545184","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/1/1 0:00:00","PubModel":"eCollection","JCR":"Q2","JCRName":"Environmental Science","Score":null,"Total":0}
引用次数: 0

摘要

流程发现方法通过分析业务数据来自动发现结构化信息,即流程模型。流程模型的质量是通过质量维度、完整性(重放适配性)、精确性、简单性和概括性来衡量的。传统的流程发现算法通常只输出一个流程模型。单一模型可能无法准确捕捉观察到的行为,并且会过拟合训练数据。我们将流程发现问题纳入一个多目标框架,为最终用户提供多个候选解决方案,用户可根据本地环境约束条件(可能不断变化)选择一个合适的模型。我们考虑在多目标框架下采用二元差分进化法来完成流程发现任务。所提出的方法采用了二分交叉/突变算子。参数的调整采用灰色关系分析与田口方法相结合的方法。我们将提出的方法与著名的单目标算法和最先进的多目标进化算法--非优势排序遗传算法(NSGA-II)进行了比较。此外,还通过计算质量维度的加权平均值进行了比较。结果表明,所提出的算法计算效率高,并能产生多样化的候选解决方案,在适应度函数上得分较高。结果表明,拟议方法生成的流程模型优于或至少与最先进算法生成的流程模型一样好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multiobjective Binary Differential Approach with Parameter Tuning for Discovering Business Process Models: MoD-ProM.

Process discovery approaches analyze the business data to automatically uncover structured information, known as a process model. The quality of a process model is measured using quality dimensions, completeness (replay fitness), preciseness, simplicity, and generalization. Traditional process discovery algorithms usually output a single process model. A single model may not accurately capture the observed behavior and overfit the training data. We have formed the process discovery problem in a multiobjective framework that yields several candidate solutions for the end user who can pick a suitable model based on the local environmental constraints (possibly varying). We consider the Binary Differential Evolution approach in a multiobjective framework for the task of process discovery. The proposed method employs dichotomous crossover/mutation operators. The parameters are tuned using grey relational analysis combined with the Taguchi approach. We have compared the proposed approach with the well-known single-objective algorithms and state-of-the-art multiobjective evolutionary algorithm-Nondominated Sorting Genetic Algorithm (NSGA-II). Additional comparison via computing a weighted average of the quality dimensions is also undertaken. Results show that the proposed algorithm is computationally efficient and produces diversified candidate solutions that score high on the fitness functions. It is shown that the process models generated by the proposed approach are superior to or at least as good as those generated by the state-of-the-art algorithms.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
The Scientific World Journal
The Scientific World Journal 综合性期刊-综合性期刊
CiteScore
5.60
自引率
0.00%
发文量
170
审稿时长
3.7 months
期刊介绍: The Scientific World Journal is a peer-reviewed, Open Access journal that publishes original research, reviews, and clinical studies covering a wide range of subjects in science, technology, and medicine. The journal is divided into 81 subject areas.
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信