US 11,892,934 B2
Process tree discovery using a probabilistic inductive miner
Roeland Johannus Scheepens, Eindhoven (NL); and Dennis Brons, Eindhoven (NL)
Assigned to UiPath, Inc., New York, NY (US)
Filed by UiPath, Inc., New York, NY (US)
Filed on Jan. 29, 2021, as Appl. No. 17/161,725.
Application 17/161,725 is a continuation in part of application No. 17/013,624, filed on Sep. 6, 2020, granted, now 11,500,756.
Prior Publication US 2022/0075706 A1, Mar. 10, 2022
This patent is subject to a terminal disclaimer.
Int. Cl. G06F 11/34 (2006.01); G06F 16/901 (2019.01); G06F 16/28 (2019.01); G06Q 10/0633 (2023.01)
CPC G06F 11/3476 (2013.01) [G06F 11/3409 (2013.01); G06F 16/285 (2019.01); G06F 16/9024 (2019.01); G06Q 10/0633 (2013.01); G06F 2201/86 (2013.01)] 9 Claims
OG exemplary drawing
 
1. A computer implemented method for generating a process tree of a process, 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.