Discovery of Process Models with the Heuristics Miner
Converts the object to a Petrinet
Compute input and output bindings
Custom map profile
Frequency map profile
Create a Causal net (also Heuristics net)
Performance map profile
Create a dependency matrix
Dependency type based on Flexible Heuristics Miner (FHM)
Dependency type based on time intervals
Parallel Matrix with Lifecycle
Pipe operator
Dependency matrix plot
Precedence Matrix
Precedence Matrix
Length Two Loop Precedence Matrix
Precedence Matrix with Lifecycle
Generic print function for a Causal net
Generic print function for a dependency matrix
Renders a Causal net as graph
Renders a dependency matrix as dependency graph
Provides the heuristics miner algorithm for process discovery as proposed by Weijters et al. (2011) <doi:10.1109/CIDM.2011.5949453>. The algorithm builds a causal net from an event log created with the 'bupaR' package. Event logs are a set of ordered sequences of events for which 'bupaR' provides the S3 class eventlog(). The discovered causal nets can be visualised as 'htmlwidgets' and it is possible to annotate them with the occurrence frequency or processing and waiting time of process activities.
Useful links