Process tree discovery using a probabilistic inductive miner

An apparatus comprising:

• a memory storing computer instructions for generating a process tree of a process;
• and
• at least one processor configured to execute the computer instructions, the computer instructions configured to cause the at least one processor to perform operations of:
• receiving an event log of the process;
• determining whether a base case applies to the event log and, in response to determining that the base case applies to the event log, adding one or more nodes to the process tree;
• in response to determining that the base case does not apply to the event log, splitting the event log into sub-event logs and adding one or more nodes to the process tree, wherein splitting the event log into sub-event logs comprises:
• generating a graph of certain activities in the event log,
• clustering the certain activities based on a number of outgoing edges of each of the certain activities in the graph, and
• determining a cut location of the event log based on the clusters;
• repeating the determining and the splitting for each respective sub-event log using the respective sub-event log as the event log until it is determined that the base case applies to the event log;
• and
• outputting the process tree.

A non-transitory computer-readable medium storing computer program instructions for generating a process tree of a process, the computer program instructions when executed by at least one processor cause the at least one processor to perform operations comprising:

• receiving an event log of the process;
• determining whether a base case applies to the event log and, in response to determining that the base case applies to the event log, adding one or more nodes to the process tree;
• in response to determining that the base case does not apply to the event log, splitting the event log into sub-event logs and adding one or more nodes to the process tree, wherein splitting the event log into sub-event logs comprises:
• generating a graph of certain activities in the event log,
• clustering the certain activities based on a number of outgoing edges of each of the certain activities in the graph, and
• determining a cut location of the event log based on the clusters;
• repeating the determining and the splitting for each respective sub-event log using the respective sub-event log as the event log until it is determined that the base case applies to the event log;
• and
• outputting the process tree.