Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery
Evolutionary algorithm is an effective way to solve process discovery problem which aims to mine process models from event logs which are consistent with the real business processes. However, current evolutionary algorithms, such as GeneticMiner, ETM, and ProDiGen, converge slowly and in difficultly...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/4240584 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849305116099739648 |
|---|---|
| author | Si-Yuan Jing |
| author_facet | Si-Yuan Jing |
| author_sort | Si-Yuan Jing |
| collection | DOAJ |
| description | Evolutionary algorithm is an effective way to solve process discovery problem which aims to mine process models from event logs which are consistent with the real business processes. However, current evolutionary algorithms, such as GeneticMiner, ETM, and ProDiGen, converge slowly and in difficultly because all of them employ genetic crossover and mutation which have strong randomness. This paper proposes a hybrid evolutionary algorithm for automated process discovery, which consists of a set-based differential evolution algorithm and guided local exploration. There are three major innovations in this work. First of all, a hybrid evolutionary strategy is proposed, in which a differential evolution algorithm is employed to search the solution space and rapidly approximate the optimal solution firstly, and then a specific local exploration method joins to help the algorithm skip out the local optimum. Secondly, two novel set-based differential evolution operators are proposed, which can efficiently perform differential mutation and crossover on the causal matrix. Thirdly, a fine-grained evaluation technique is designed to assign score to each node in a process model, which is employed to guide the local exploration and improve the efficiency of the algorithm. Experiments were performed on 68 different event logs, including 22 artificial event logs, 44 noisy event logs, and two real event logs. Moreover, the proposed algorithm was compared with three popular algorithms of process discovery. Experimental results show that the proposed algorithm can achieve good performance and its converge speed is fast. |
| format | Article |
| id | doaj-art-3d0791b1d82b4d8893dd2dab149cb26f |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-3d0791b1d82b4d8893dd2dab149cb26f2025-08-20T03:55:33ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/42405844240584Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process DiscoverySi-Yuan Jing0School of Computer Science, Leshan Normal University, Leshan 614000, ChinaEvolutionary algorithm is an effective way to solve process discovery problem which aims to mine process models from event logs which are consistent with the real business processes. However, current evolutionary algorithms, such as GeneticMiner, ETM, and ProDiGen, converge slowly and in difficultly because all of them employ genetic crossover and mutation which have strong randomness. This paper proposes a hybrid evolutionary algorithm for automated process discovery, which consists of a set-based differential evolution algorithm and guided local exploration. There are three major innovations in this work. First of all, a hybrid evolutionary strategy is proposed, in which a differential evolution algorithm is employed to search the solution space and rapidly approximate the optimal solution firstly, and then a specific local exploration method joins to help the algorithm skip out the local optimum. Secondly, two novel set-based differential evolution operators are proposed, which can efficiently perform differential mutation and crossover on the causal matrix. Thirdly, a fine-grained evaluation technique is designed to assign score to each node in a process model, which is employed to guide the local exploration and improve the efficiency of the algorithm. Experiments were performed on 68 different event logs, including 22 artificial event logs, 44 noisy event logs, and two real event logs. Moreover, the proposed algorithm was compared with three popular algorithms of process discovery. Experimental results show that the proposed algorithm can achieve good performance and its converge speed is fast.http://dx.doi.org/10.1155/2020/4240584 |
| spellingShingle | Si-Yuan Jing Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery Complexity |
| title | Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery |
| title_full | Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery |
| title_fullStr | Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery |
| title_full_unstemmed | Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery |
| title_short | Set-Based Differential Evolution Algorithm Based on Guided Local Exploration for Automated Process Discovery |
| title_sort | set based differential evolution algorithm based on guided local exploration for automated process discovery |
| url | http://dx.doi.org/10.1155/2020/4240584 |
| work_keys_str_mv | AT siyuanjing setbaseddifferentialevolutionalgorithmbasedonguidedlocalexplorationforautomatedprocessdiscovery |