TELKOMNIKA Telecommunication, Computing, Electronics and Control
Graph-based algorithm for checking wrong indirect relationships in non-free choice

TELKOMNIKA Telecommunication, Computing, Electronics and Control
Graph-based algorithm for checking wrong indirect relationships in non-free choice

Decision mining, Parameterize decision mining, Process model, Wrong indirect relationships

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.

Agung Wiratmo, Kelly Rossa Sungkono, Riyanarto Sarno

DOI: 10.12928/TELKOMNIKA.v18i1.12982

Universitas Ahmad Dahlan

February 2020

Sri Wahyuni

ISSN: 1693-6930

http://journal.uad.ac.id/index.php/TELKOMNIKA

PDF

English

Text

TELKOMNIKA Telecommunication, Computing, Electronics and Control