OPTIMASI ALGORITMA APRIORI DENGAN PRUNING ITEMSET (STUDI KASUS KAFE WILAYAH KABUPATEN JEMBER)

Arifin, Ahmad Syamsul (2019) OPTIMASI ALGORITMA APRIORI DENGAN PRUNING ITEMSET (STUDI KASUS KAFE WILAYAH KABUPATEN JEMBER). Undergraduate thesis, Politeknik Negeri Jember.

	Text (Abstract) 6. ABSTRACT.pdf - Submitted Version Available under License Creative Commons Attribution Share Alike. Download (7kB)
	Text (Bab 1 Pendahuluan) 14. BAB 1 PENDAHULUAN.pdf - Submitted Version Available under License Creative Commons Attribution Share Alike. Download (115kB)
	Text (Daftar Pustaka) 19. DAFTAR PUSTAKA.pdf - Submitted Version Available under License Creative Commons Attribution Share Alike. Download (70kB)
	Text (Laporan Lengkap) 21. E41151627_LAPORAN LENGKAP.pdf Restricted to Registered users only Download (2MB)

Abstract

Apriori algorithm is one of the most used algorithms in conducting market basket analysis. This is because the calculation results of apriori algorithm have a fairly high level of accuracy. Also, apriori algorithm is an algorithm that has long been recognized since introduced by Agrawal and Srikan in 1994. However, apriori algorithm itself has shortcomings in scanning data, which causes high time consumption. This is because the calculation results of apriori algorithm have a good level of accuracy. Therefore an optimization is needed to improve the performance of apriori algorithm. In this study, applied apriori with 355 menu items and 4029 transaction data that took 4638.95 seconds. Whereas in optimized apriori also applied with the same data only takes 2199.53 seconds. So that apriori performance was successfully improved with 52% faster results.

Item Type:

Thesis (Undergraduate)

Contributors: