.png){kind=icon}
Return
Decomposed and parallel process discovery: A framework and application
.png){kind=icon}
PRE
AI
DOI：10.1016/j.future.2019.03.048.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The rapid growth of event data motivates the developing of decomposed and parallel process discovery, which solves process discovery from a large event log by decomposing the log into multiple small event logs, discovering process models from these small logs in parallel, and merging discovered process models. As such, process discovery from a large event log can be solved in less time. Currently, the passage and maximal decomposition based techniques are successful in the activity partition by decomposing causal graph structure derived from a large event log. In this paper, we propose a five-step framework, based on which we can build various decomposed and parallel process discovery techniques by simply combining and adapting existing techniques. Then, we propose a technique, RPSTHD, based on the framework using the refined process structure tree (RPST), heuristic miner, process mining using integer linear programming (ILP), etc. An experimental evaluation shows that our technique significantly outperforms the state-of-the-art decomposed discovery techniques in both efficiency and effectiveness. (C) 2019 Elsevier B.V. All rights reserved.
Keywords:
MINING PROCESS MODELS
DIVIDE-AND-CONQUER
PETRI NETS
Journal
F
IF:
6.1
Papers:
6.9K
Citations:
2.3W
Organization
View more organizations
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSave
ShareSave View more