Comparative Analysis of Association Rule Mining Algorithms Using Apriori and Eclat on Retail Transaction Data
DOI:
https://doi.org/10.30871/jaic.v10i2.12122Keywords:
Apriori algorithm, Association rule mining, Product recommendation, Support, ConfidenceAbstract
Retail transaction data can be utilized to identify consumer purchasing patterns and product relationships. This study evaluates and compares the performance of the Apriori and ECLAT algorithms in generating association rules from a retail dataset comprising 30,000 transactions collected between January and April 2025. A grid search method was employed to determine the optimal minimum support and minimum confidence thresholds. Using a minimum support of 0.005 and a minimum confidence of 0.3, both algorithms generated 1,736 frequent itemsets and 78 association rules. The resulting rules were assessed using support, confidence, and lift measures, and all rules obtained lift values greater than 1, indicating meaningful positive dependencies among products. The strongest rule revealed that customers who purchased Bread and Milk were highly likely to also purchase Cereal, with a confidence of 60.5% and a lift value of 2.70. Although both algorithms produced comparable rule quality, ECLAT demonstrated superior computational efficiency due to its vertical data representation approach. These findings provide practical insights for retail decision-making, particularly in cross-selling strategies, product bundling, and shelf arrangement optimization.
Downloads
References
[1] I. F. Rahman and D. Riana, “Market Basket Analysis untuk Penjualan Retail: Perbandingan Akurasi Algoritma Apriori dan FP-Growth Berbasis CRISP-DM,” J. Algoritma, vol. 22, no. 1, pp. 468–479, May 2025, doi: 10.33364/algoritma/v.22-1.2303.
[2] A. Setiawan, V. Kurniawan, and R. Novita, “Application of the Eclat Algorithm to Find Relationship Patterns Between Items in Sales Transaction Data,” 2024.
[3] I. P. S. Handika and I. K. S. Satwika, “Perbandingan Kinerja Algoritma Apriori Dan Equivalence Class Transformation (Eclat) Dalam Menemukan Pola Pembelian Pada Data Transaksi Minimarket,” vol. 9, no. 2, 2024.
[4] Dr. Y. Arora and Dr. Y. Arora, “Market Basket Analysis using Apriori Algorithm,” Int. J. Innov. Res. Comput. Sci. Technol., pp. 62–66, May 2022, doi: 10.55524/ijircst.2022.10.3.12.
[5] S. Aulia Miranda, F. Fahrullah, and D. Kurniawan, “Implementasi Association Rule Dalam Menganalisis Data Penjualan Sheshop dengan Menggunakan Algoritma Apriori,” METIK J., vol. 6, no. 1, pp. 30–36, Jul. 2022, doi: 10.47002/metik.v6i1.342.
[6] D. B. Wardana, “Analisa Data Mining Menggunakan Algoritma Apriori Dan Algoritma Eclat Di PT Astra International BMW Semarang,” vol. 17, no. 1, 2024.
[7] Yusuf Husain, Enny Dwi Oktaviyani, and Sherly Christina, “Analisis Perbandingan Algoritma Apriori, FP-Growth, Dan Eclat dalam Menemukan Pola Pembelian Konsumen,” KONSTELASI Konvergensi Teknol. Dan Sist. Inf., vol. 3, no. 2, pp. 231–243, Dec. 2023, doi: 10.24002/konstelasi.v3i2.7007.
[8] A. N. Saputri, A. F. Setiawan, and J. D. Irawan, “Analisis Pola Pembelian Di Toko Berkah Afi Menggunakan Metode Algoritma Apriori,” vol. 9, no. 6, 2025.
[9] M. Mariko, “Perbandingan Algoritma Apriori Dan Algoritma Fp-Growth Untuk Rekomendasi Item Paket Pada Konten Promosi,” vol. 11, no. 2, 2021.
[10] “Retail Transaction Dataset”.
[11] Bhargavi Konda, “The impact of data preprocessing on data mining outcomes,” World J. Adv. Res. Rev., vol. 15, no. 3, pp. 540–544, Sep. 2022, doi: 10.30574/wjarr.2022.15.3.0931.
[12] T. Prasetya, J. E. Yanti, A. I. Purnamasari, A. R. Dikananda, and O. Nurdiawan, “Analisis Data Transaksi Terhadap Pola Pembelian Konsumen Menggunakan Metode Algoritma Apriori,” Inform. Educ. Prof. J. Inform., vol. 6, no. 1, p. 43, Apr. 2022, doi: 10.51211/itbi.v6i1.1688.
[13] I. W. Supriana, “Implementasi Algoritma Apriori sebagai Association Rule Learning untuk Mengidentifikasi Pola Item Dataset Penjualan”.
[14] L. Aprita and A. Perdana, “Penerapan Metode Data Mining terhadap Data Transaksi Penjualan Menggunakan Algoritma Apriori pada Toko Metro Akustik,” J. Teknol. Inform. Dan Komput., vol. 9, no. 1, pp. 274–283, Mar. 2023, doi: 10.37012/jtik.v9i1.1381.
[15] M. Briliantino and A. Perdana, “Penerapan Algoritma Apriori pada Analisis Data Transaksi penjualan UMKM Banyu Burgerbar,” J. Teknol. Inform. Dan Komput., vol. 9, no. 1, pp. 61–71, Mar. 2023, doi: 10.37012/jtik.v9i1.1339.
[16] E. Alma’arif, E. Utami, and F. W. Wibowo, “Implementasi Algoritma Apriori Untuk Rekomendasi Produk Pada Toko Online,” Creat. Inf. Technol. J., vol. 7, no. 1, p. 63, Mar. 2021, doi: 10.24076/citec.2020v7i1.241.
[17] Nurul Nisa Habibah, Widodo, and Bambang Prasetya Adhi, “Proses Association Rule Untuk Mengetahui Kecenderungan Belanja Pada Kopma Unj Menggunakan Algoritma Apriori Dan Eclat,” PINTER J. Pendidik. Tek. Inform. Dan Komput., vol. 6, no. 1, pp. 30–39, Jun. 2022, doi: 10.21009/pinter.6.1.5.
[18] L. Veronika and F. Syakti, “Perbandingan Algoritma Apriori dan Algoritma Eclat dalam penentuan pola peminjaman buku pada Perpustakaan Stikes Abdi Nusa Palembang”.
[19] E. Halimatussa’diyah and S. K. Dini, “Implementasi Metode Content-Based Filtering Dengan Pendekatan Euclidean Distance Dalam Sistem Rekomendasi Produk Skincare,” Rabit J. Teknol. Dan Sist. Inf. Univrab, vol. 10, no. 2, pp. 763–783, Jul. 2025, doi: 10.36341/rabit.v10i2.6371.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2026 Keisya Aqila Putri Kausara, MY Teguh Sulistyono
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License (Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) ) that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
