causal_bindings

Computes the input- and output bindings for use in a causal map. Several heuristics may be used to determine
the activities that are activated or consumed by an event. The Flexible Heuristic Miner (FHM) paper describes
a heuristic that looks ahead (or looks back) until the end of the trace and determines those activities as activated
for which no other cause (activity in a causal dependency) is found. This approach is implemented as type <code>nearest</code>.

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.

Felix Mannhardt

heuristicsmineR

Discovery of Process Models with the Heuristics Miner

Gert Janssenswillen

causal_bindings function

<dl><dt>eventlog</dt>
<dd>The bupaR event log.</dd>
<dt>dependencies</dt>
<dd>A dependency matrix obtained, for example, through <code>dependency_matrix</code>.</dd>
<dt>type</dt>
<dd>The heuristic used to determine the bindings. Currently only <code>nearest</code> is available.</dd></dl>

Arguments

Compute input and output bindings — causal_bindings

<dl>

<dt>eventlog</dt>
<dd>The bupaR event log.</dd>


<dt>dependencies</dt>
<dd>A dependency matrix obtained, for example, through <code>dependency_matrix</code>.</dd>


<dt>type</dt>
<dd>The heuristic used to determine the bindings. Currently only <code>nearest</code> is available.</dd>

</dl>

causal_bindings: Compute input and output bindings

Description

Usage

Value

Arguments

Examples