public class GlobalCompletenessPlugin
extends java.lang.Object
The core part of the program is an inequality, $M*M*M/[4*e*e*(1-K)] < N$, where
In the program, an event log will be parsed and each of traces is represented with a String, namely a sequence of task names.
For more detail please refer to our paper.
| Constructor and Description |
|---|
GlobalCompletenessPlugin() |
| Modifier and Type | Method and Description |
|---|---|
LogMetricResult |
requestConfidenceAndError(org.processmining.contexts.uitopia.UIPluginContext context,
org.deckfour.xes.model.XLog log) |
public LogMetricResult requestConfidenceAndError(org.processmining.contexts.uitopia.UIPluginContext context, org.deckfour.xes.model.XLog log)