Decomposed process mining with DivideAndConquer

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
72 Downloads (Pure)


Many known process mining techniques scale badly in the number of activities in an event log. Examples of such techniques include the ILP Miner and the standard replay, which also uses ILP techniques. To alleviate the problems these techniques face, we can decompose a large problem (with many activities) into a number of small problems (with few activities). Expectation is, that the run times of such a decomposed setting will be faster than the run time of the original setting. This paper presents the DivideAndConquer tool, which allows the user to decompose a large problem into small problems, to run the desired discovery or replay technique on each of these decomposed problems, and to merge the results into a single result, which can then be shown to the user.
Original languageEnglish
Title of host publicationBPM Demo Sessions 2014 (co-located with BPM 2014, Eindhoven, The Netherlands, September 20, 2014)
EditorsL. Limonad, B. Weber
Publication statusPublished - 2014
Event12th International Conference on Business Process Management, BPM 2014 - Eindhoven, Netherlands
Duration: 7 Sep 201411 Sep 2014
Conference number: 12

Publication series

NameCEUR Workshop Proceedings
ISSN (Print)1613-0073


Conference12th International Conference on Business Process Management, BPM 2014
Abbreviated titleBPM 2014
OtherConference was originally planned in Haifa, but due to the unstable situation in southern Israel, it was relocated to Eindhoven. BPM Demo Sessions 2014, BPMD 2014, Co-located with the 12th International Conference on Business Process Management, BPM 2014
Internet address


Dive into the research topics of 'Decomposed process mining with DivideAndConquer'. Together they form a unique fingerprint.

Cite this