Risna Lailatun Najmi
Universitas Islam Negeri Sultan Syarif Kasim Riau, Pekanbaru

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Analisis Pola Asosiasi Data Transaksi Penjualan Minuman Menggunakan Algoritma FP-Growth dan Eclat Risna Lailatun Najmi; Muhammad Irsyad; Fitri Insani; Alwis Nazir; Pizaini .
Building of Informatics, Technology and Science (BITS) Vol 5 No 1 (2023): Juni 2023
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v5i1.3592

Abstract

Every day transaction activities between companies and consumers continue to be carried out. This makes transaction data more and more and accumulate. This transaction data can be processed into more useful information using technology. Data mining is a technology that can work on a collection of transaction data into information that can be taken by companies as decision makers. The association rule method is used as a method to see the relationship between items in a transaction data. To analyze transaction data, researchers used the FP-Growth and Eclat algorithms. There are three stages of association in this study which are distinguished from the confidence value. The results in the first stage have a minimum confidence value of 0.4, the FP-Growth algorithm produces 41 association pattern rules, while the Eclat algorithm produces 32 association pattern rules. Then in the second stage the minimum trust value is 0.5, the FP-Growth algorithm produces 40 association pattern rules, for the Eclat algorithm it produces 32 association pattern rules. In the third stage, the minimum trust value is 0.6, the FP-Growth algorithm generates 32 association pattern rules, while the Eclat algorithm generates 30 association pattern rules. The results of the association pattern rules show that the Eclat algorithm is more efficient in determining the association pattern rules than the Fp-Growth algorithm