precedence_matrix_absolute

Construct a precedence matrix, showing how activities are followed by each other.
This function computes the precedence matrix directly in C++ for efficiency.
Only the type <code>absolute</code> of (<code>precedence_matrix</code>) is supported.

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

precedence_matrix_absolute function

<dl><dt>eventlog</dt>
<dd>The event log object to be used.</dd>
<dt>lead</dt>
<dd>The distance between activities following/preceding each other.</dd></dl>

Arguments

Precedence Matrix — precedence_matrix_absolute

<dl>

<dt>eventlog</dt>
<dd>The event log object to be used.</dd>


<dt>lead</dt>
<dd>The distance between activities following/preceding each other.</dd>

</dl>

precedence_matrix_absolute: Precedence Matrix

Description

Usage

Arguments

Examples