Graph-based algorithm for checking wrong indirect relationships in non-free choice

In this context, this paper proposes a combination of parameterised decision mining and relation sequences to detect wrong indirect relationship in the non-free choice. The existing decision mining without parameter can only detect the direction, but not the correctness. This paper aims to identify the direction and correctness with decision mining with parameter. This paper discovers a graph process model based on the event log. Then, it analyses the graph process model for obtaining decision points. Each decision point is processed by using parameterised decision mining, so that decision rules are formed. The derived decision rules are used as parameters of checking wrong indirect relationship in the non-free choice. The evaluation shows that the checking wrong indirect relationships in non-free choice with parameterised decision mining have 100% accuracy, whereas the existing decision mining has 90.7% accuracy.