Penerapan Algoritma FP-Growth dan K-Means Clustering dalam Analisis Pola Asosiasi Berdasarkan Segmentasi Pelanggan
Abstract
The pharmaceutical industry has experienced rapid growth, urging companies to leverage sales data effectively to enhance data-driven marketing strategies. However, utilizing sales data remains a challenge for XYZ company, a pharmaceutical distributor. This study aims to analyze customer purchasing patterns by applying the FP-Growth algorithm for association analysis, combined with customer segmentation using the K-Means algorithm based on RFM (Recency, Frequency, Monetary) analysis. The segmentation process resulted in four customer clusters: active and loyal customers (Cluster 1), passive customers (Cluster 2), less active customers (Cluster 3), and new customers (Cluster 4). FP-Growth analysis for each cluster revealed that Cluster 1 generated 10 significant association rules with a minimum support of 0.01 and confidence of 0.7, while Clusters 2, 3, and 4 produced 2, 3, and 4 association rules, respectively, with adjusted parameters. All rules showed a lift value > 1, indicating positive relationships between products. The findings of this study provide strategic insights for companies in designing data-driven marketing approaches, such as more targeted product offerings for loyal customers or retention strategies for passive customers, thereby optimizing sales and increasing profitability in each customer segment.
Downloads
References
World Health Organization, “Global Health Observatory Data Repository.” Accessed: Jan. 01, 2025. [Online]. Available: https://www.who.int/data/gho
IQVIA, “The Global Use of Medicine in 2020.” Accessed: Jan. 01, 2025. [Online]. Available: https://www.iqvia.com/
P. Kotler and K. L. Keller, Marketing Management, 15th ed. Harlow: Pearson Education, 2020.
E. Anggraiani, Satibi, and L. R. Fauzi, “Analisis Faktor-Faktor yang Mempengaruhi Rencana Kebutuhan Obat dan E-Procurement di Rumah Sakit di Indonesia,” Majalah Farmaseutik, vol. 19, no. 2, pp. 214–220, 2023, doi: 10.22146/farmaseutik.v19i2.77944.
F. Sulianta and E. Prayogo, “Aturan Asosiasi Menggunakan Algoritma Apriori Untuk Menciptakan Strategi Pemasaran Pada Apotek,” Jurnal Teknik Elektro dan Informatika, vol. 19, no. 1, pp. 83–89, 2024.
R. Yogasuwara, Ferdiansyah, Andri, and L. Atika, “Implementasi Algoritma Frequent Growth (FP-Growth) Menentukan Asosiasi Antar Produk,” Jurnal Sistem Komputer dan Informatika (JSON), vol. 4, no. 1, pp. 165–171, Sep. 2022, doi: 10.30865/json.v4i1.4894.
A. Wilrose, M. Afdal, S. Monalisa, and M. R. Munzir, “Penerapan Algoritma FP-Growth untuk Menentukan Strategi Promosi Berdasarkan Waktu dan Pembelian Produk,” Building of Informatics, Technology and Science (BITS), vol. 5, no. 1, pp. 104–113, Jun. 2023, doi: 10.47065/bits.v5i1.3577.
H. D. Ariyantini, D. Malita Puspita, and A. Triyono, “Implementasi Algoritma Fp-Growth Untuk Rekomendasi Produk Di Toko Lm Mart,” Jurnal Ilmu Komputer An Nuur, vol. 4, no. 1, pp. 1–12, Jan. 2024.
M. R. A. Utama, R. Umar, and A. Yudhana, “Penerapan Algoritma Fp-Growth Untuk Penentuan Pola Pembelian Transaksi Penjualan Pada Toko Kgs Rizky Motor,” Jurnal DINAMIK, vol. 25, no. 1, pp. 20–28, Jan. 2020.
R. Fauzi, A. W. Aranski, Nopriadi, and E. Hutabri, “Implementasi Data Mining Pada Penjualan Pakaian dengan Algoritma FP-Growth,” JURIKOM (Jurnal Riset Komputer), vol. 10, no. 2, pp. 436–445, Apr. 2023, doi: 10.30865/jurikom.v10i2.5795.
Y. Husain, E. D. Oktaviyani, and S. Christina, “Analisis Perbandingan Algoritma Apriori, FP-Growth, dan Eclat dalam Menemukan Pola Pembelian Konsumen,” KONSTELASI: Konvergensi Teknologi dan Sistem Informasi, vol. 3, no. 2, pp. 231–243, Dec. 2023.
I. Musdalifah and A. Jananto, “Analisis Perbandingan Algoritma Apriori Dan FP-Growth Dalam Pembentukan Pola Asosiasi Keranjang Belanja Pelanggan,” Jurnal Ilmiah Komputer, vol. 18, no. 2, pp. 175–184, Aug. 2022.
D. Rachmawati, Y. Cahyana, E. E. Awal, and S. Faisal, “Perbandingan Algoritma Apriori dan Algoritma FP-Growth dalam Menentukan Pola Penjualan Pupuk,” JURNAL RESISTOR, vol. 21, no. 1, pp. 21–31, Apr. 2024, [Online]. Available: https://s.id/jurnalresistor
A. T. Suseno, A. R. Naufal, and M. Al Amin, “Market Based Analysis Sebagai Peningkatan Penjualan Produk Menggunakan Algoritma K-Medoids Dan Fp-Growth,” Jurnal Teknik Informasi dan Komputer (Tekinkom), vol. 5, no. 2, pp. 301–308, Dec. 2022, doi: 10.37600/tekinkom.v5i2.646.
S. A. Perdana, S. F. Florentin, and A. Santoso, “Analisis Segmentasi Pelanggan Menggunakan K-Means Clustering Studi Kasus Aplikasi Alfagift,” Sebatik, vol. 26, no. 2, pp. 446–457, Dec. 2022, doi: 10.46984/sebatik.v26i2.2134.
A. Pramudiansyah and H. Munte, “Segmentasi Pelanggan Menggunakan Algoritma K-Means Berdasarkan Model Recency Frequency Monetary,” Jurnal Ilmiah Ilmu Komputer, vol. 7, no. 2, pp. 6–19, 2021, [Online]. Available: http://ejournal.fikom-unasman.ac.id
A. H. Fazri, A. Muhammad, and P. A. W. Purnama, “Algoritma K-Means Cluster Untuk Segmentasi Pelanggan,” CBIS JOURNAL, vol. 11, no. 02, pp. 42–51, 2023, [Online]. Available: http://ejournal.upbatam.ac.id/index.php/cbishttp://ejournal.upbatam.ac.id/index.php/cbis
W. A. Silamantha and K. Hadiono, “Analisis RFM dan K-Means Clustering untuk Segmentasi Pelanggan pada PT. Sanutama Bumi Arto,” KESATRIA: Jurnal Penerapan Sistem Informasi, vol. 5, no. 3, pp. 1297–1305, Jul. 2024.
R. B. Ardi, F. Ely Nastiti, and S. Sumarlinda, “Algoritma K-Means Clustering Untuk Segmentasi Pelanggan (Studi Kasus : Fashion Viral Solo),” INFOTECH journal, vol. 9, no. 1, pp. 124–131, May 2023, doi: 10.31949/infotech.v9i1.5214.
D. Hartama, Wanayumini, and I. S. Damanik, “Pengelompokan Algoritma K-Means dan K-Medoid Berdasarkan Lokasi Daerah Rawan Bencana di Indonesia dengan Optimasi Elbow, DBI, dan Silhouette,” Building of Informatics, Technology and Science (BITS), vol. 6, no. 2, pp. 1151–1158, 2024, doi: 10.47065/bits.v6i2.5851.
S. Genjang Setyorini, E. K. Sari, L. Rahma Elita, and S. A. Putri, “Analisis Keranjang Pasar Menggunakan Algoritma K-Means dan FP-Growth pada PT. Citra Mustika Pandawa,” MALCOM, vol. 1, no. 1, pp. 41–46, Apr. 2021.
T. Ayunita Pertiwi, M. Afdal, R. Novita, and Mustakim, “Penerapan Algoritma K-Medoids dan FP-Growth dalam Penentuan Pola Kombinasi Produk Berdasarkan Hasil Segmentasi Pelanggan,” Technology and Science (BITS), vol. 6, no. 2, pp. 721–732, Sep. 2024, doi: 10.47065/bits.v6i2.5268.
D. Anjainah and S. Monalisa, “Analisis Rekomendasi Produk Berdasarkan Segmentasi Pelanggan Menggunakan Algoritma DBSCAN dan FP-Growth,” Techno.COM, vol. 21, no. 4, pp. 948–956, Nov. 2022.
A. Rahmah and M. Afdal, “Segmentasi Pelanggan Menggunakan Fuzzy C-Means dan FP-Growth Berdasarkan Model LRFM untuk Rekomendasi Produk,” JURNAL MEDIA INFORMATIKA BUDIDARMA, vol. 8, no. 3, pp. 1218–1227, Jul. 2024, doi: 10.30865/mib.v8i3.7737.
F. Pangestu, N. Yasin, R. C. Hasugian, and Yunita, “Penerapan Algoritma K-Means Untuk Mengklasifikasi Data Obat,” Jurnal Sisfokom (Sistem Informasi dan Komputer), vol. 12, no. 1, pp. 53–62, Mar. 2023, doi: 10.32736/sisfokom.v12i1.1461.
A. Rajsya, Purnawansyah, and A. R. Rachman, “Rancang Bangun Penerapan Metode Elbow Pada K-Means Untuk Clustering Data Persediaan Barang,” Literatur Informatika & Komputer, vol. 1, no. 4, pp. 395–403, 2024, doi: 10.33096/linier.vxix.xxxx.
Y. Hasan, “Pengukuran Silhouette Score dan Davies-Bouldin Index pada Hasil Cluster K-Means dan Dbscan,” Kumpulan Artikel Karya Ilmiah Fakultas Ilmu Komputer, vol. 06, no. 01, pp. 60–74, 2024.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Algoritma FP-Growth dan K-Means Clustering dalam Analisis Pola Asosiasi Berdasarkan Segmentasi Pelanggan
Pages: 1675-1685
Copyright (c) 2025 Aldiansyah Pramudia Hasibuan, Fitri Insani, Alwis Nazir, Iis Afrianty

This work is licensed under a Creative Commons Attribution 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 Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment 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 acknowledgment 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 (Refer to The Effect of Open Access).






















