Path: Top -> Journal -> Telkomnika -> 2020 -> Vol 18, No 1, February
Graph-based algorithm for checking wrong indirect relationships in non-free choice
Oleh : Agung Wiratmo, Kelly Rossa Sungkono, Riyanarto Sarno, Telkomnika
Dibuat : 2020-12-04, dengan 1 file
Keyword : decision mining; parameterize decision mining; process model; wrong indirect relationships
Url : http://journal.uad.ac.id/index.php/TELKOMNIKA/article/view/12982
Sumber pengambilan dokumen : WEB
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
Beri Komentar ?#(0) | Bookmark
Properti | Nilai Properti |
---|---|
ID Publisher | gdlhub |
Organisasi | Telkomnika |
Nama Kontak | Herti Yani, S.Kom |
Alamat | Jln. Jenderal Sudirman |
Kota | Jambi |
Daerah | Jambi |
Negara | Indonesia |
Telepon | 0741-35095 |
Fax | 0741-35093 |
E-mail Administrator | elibrarystikom@gmail.com |
E-mail CKO | elibrarystikom@gmail.com |
Print ...
Kontributor...
- , Editor: sukadi
Download...
Download hanya untuk member.
12982-39762-1-PB
File : 12982-39762-1-PB.pdf
(397473 bytes)