Indulpet miner : combining discovery algorithms

Leemans, Sander J.J., Tax, Niek & ter Hofstede, Arthur H.M. (2018). Indulpet miner : combining discovery algorithms. In Dumitru Roman, Henderik A. Proper, Robert Meersman, Hervé Panetto, Christophe Debruyne & Claudio Agostino Ardagna (Eds.), On the Move to Meaningful Internet Systems. OTM 2018 Conferences – Confederated International Conferences (pp. 97-115). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), No. 11229 LNCS). Springer.


In this work, we explore an approach to process discovery that is based on combining several existing process discovery algorithms. We focus on algorithms that generate process models in the process tree notation, which are sound by design. The main components of our proposed process discovery approach are the Inductive Miner, the Evolutionary Tree Miner, the Local Process Model Miner and a new bottom-up recursive technique. We conjecture that the combination of these process discovery algorithms can mitigate some of the weaknesses of the individual algorithms. In cases where the Inductive Miner results in overgeneralizing process models, the Evolutionary Tree Miner can often mine much more precise models. At the other hand, while the Evolutionary Tree Miner is computationally expensive, running it only on parts of the log that the Inductive Miner is not able to represent with a precise model fragment can considerably limit the search space size of the Evolutionary Tree Miner. Local Process Models and bottom-up recursion aid the Evolutionary Tree Miner further by instantiating it with frequent process model fragments. We evaluate our approaches on a collection of real-life event logs and find that it does combine the advantages of the miners and in some cases surpasses other discovery techniques.

Leave a Reply