MOEA for discovering Pareto-optimal process models: an experimental comparison

被引:8
作者
Deshmukh, Sonia [1 ]
Agarwal, Manoj [2 ]
Gupta, Shikha [3 ]
Kumar, Naveen [1 ]
机构
[1] Univ Delhi, Dept Comp Sci, Delhi, India
[2] Univ Delhi, Hans Raj Coll, Delhi, India
[3] Univ Delhi, Shaheed Sukhdev Coll Business Studies, Delhi, India
关键词
process discovery; evolutionary algorithms; Pareto-front; multi-objective optimisation; process model quality dimensions; PAES; SPEA-II; NSGA-II; completeness; generalisation; OPTIMIZATION; ALGORITHM; EVOLUTION; TASKS;
D O I
10.1504/IJCSE.2020.106067
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Process mining aims at discovering the workflow of a process from the event logs that provide insights into organisational processes for improving these processes and their support systems. Process mining abstracts the complex real-life datasets into a well-structured form known as a process model. In an ideal scenario, a process mining algorithm should produce a model that is simple, precise, general and fits the available logs. A conventional process mining algorithm typically generates a single process model that may not describe the recorded behaviour effectively. Multi-objective evolutionary algorithms (MOEA) for process mining optimise two or more objectives to generate several competing process models from the event logs. Subsequently, a user can choose a model based on his/her preference. In this paper, we have experimentally compared the popular second-generation MOEA algorithms for process mining.
引用
收藏
页码:446 / 456
页数:11
相关论文
共 27 条
  • [1] Alves de Medeiros A., 2004, BETA Working Paper Series
  • [2] [Anonymous], 2013, THESIS
  • [3] Particle swarm optimisation with time varying cognitive avoidance component
    Biswas, Anupam
    Biswas, Bhaskar
    Kumar, Anoj
    Mishra, K. K.
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2018, 16 (01) : 27 - 41
  • [4] Buijs J.C., 2012, On the Move to Meaningful Internet Systems: OTM 2012, P305, DOI [DOI 10.1007/978-3-642-33606-5_19, 10.1007/978-3-642-33606-5_19]
  • [5] Cook J. E., 1998, ACM Transactions on Software Engineering and Methodology, V7, P215, DOI 10.1145/287000.287001
  • [6] de Medeiros A.K.A., 2006, Genetic process mining
  • [7] Gupta S, 2015, 2015 NATIONAL CONFERENCE ON RECENT ADVANCES IN ELECTRONICS & COMPUTER ENGINEERING (RAECE), P244, DOI 10.1109/RAECE.2015.7510199
  • [8] Improved artificial bee colony algorithm with differential evolution for the numerical optimisation problems
    Jiang, Jiongming
    Xue, Yu
    Ma, Tinghuai
    Chen, Zhongyang
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2018, 16 (01) : 73 - 84
  • [9] Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
    Knowles, Joshua D.
    Corne, David W.
    [J]. EVOLUTIONARY COMPUTATION, 2000, 8 (02) : 149 - 172
  • [10] Lai X., INT J COMPUTATIONAL