Perfecting a Video Game with Game Metrics
Vol 18, No 1: February 2020

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

Agung Wiratmo (Institut Teknologi Sepuluh Nopember)
Kelly Rossa Sungkono (Institut Teknologi Sepuluh Nopember)
Riyanarto Sarno (Institut Teknologi Sepuluh Nopember)



Article Info

Publish Date
01 Feb 2020

Abstract

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.

Copyrights © 2020






Journal Info

Abbrev

TELKOMNIKA

Publisher

Subject

Computer Science & IT

Description

Submitted papers are evaluated by anonymous referees by single blind peer review for contribution, originality, relevance, and presentation. The Editor shall inform you of the results of the review as soon as possible, hopefully in 10 weeks. Please notice that because of the great number of ...