Implementation of Data Mining for Analyzing Consumer Purchasing Patterns at TeTa Ino Cafe

Authors

  • Theresia Elvita Tjia Universitas Cokroaminoto Palopo, Indonesia
  • Fajar Novriansyah Yasir Universitas Cokroaminoto Palopo, Indonesia
  • Shindy Ekawati Universitas Cokroaminoto Palopo, Indonesia

DOI:

https://doi.org/10.47709/brilliance.v5i2.6767

Keywords:

Clustering, CRISP-DM, K-Means Algorithm, Marketing Strategy, Purchase Pattern

Abstract

TeTa Ino is a micro, small, and medium enterprise by university students focusing on the production and marketing of innovative products based on butterfly pea tea. The significant decrease in sales volume from approximately 50–80 units per promotional event to only 20–40 units indicates a potential issue in the current marketing strategy. Therefore, this study aims to identify consumer purchasing patterns that can serve as the foundation for developing more targeted marketing strategies to enhance the competitiveness of TeTa Ino. This research employs the Cross Industry Standard Process for Data Mining (CRISP-DM) approach by applying the K-Means Clustering algorithm to four months of transaction data, including variables such as number of transactions, total transaction value, and discounts offered. The analysis resulted in four distinct consumer clusters: passive consumers, loyal consumers, non-loyal consumers, and consumers with moderate purchasing frequency. Each cluster is recommended to be approached with tailored marketing strategies, such as loyalty programs, product benefit education, and bundling promotions. The clustering evaluation achieved a Silhouette Score of 0.9008 and a Calinski Harabasz Score of 7630.34, indicating good segmentation quality and clear separation among clusters. This study concludes that applying the K-Means Clustering algorithm is effective in mapping consumer purchasing behavior as a basis for data-driven marketing strategy formulation. Future research is recommended to incorporate time-related variables and explore other clustering methods to further strengthen the analysis.

Author Biography

Fajar Novriansyah Yasir, Universitas Cokroaminoto Palopo, Indonesia

Lecturer, Department of Informatics, Faculty of Computer Science, Universitas Cokroaminoto Palopo.

References

Ahmed, M., Seraj, R., & Islam, S. M. S. (2020). The k-means algorithm: A comprehensive survey and performance evaluation. Electronics (Switzerland), 9(8), 1–12. https://doi.org/10.3390/electronics9081295

Astuti, D. (2019). Penentuan Strategi Promosi Usaha Mikro Kecil Dan Menengah (UMKM) Menggunakan Metode CRISP-DM dengan Algoritma K-Means Clustering. Journal of Informatics, Information System, Software Engineering and Applications (INISTA), 1(2), 60–72. https://doi.org/10.20895/inista.v1i2.71

Gelar Guntara, R. (2023). Deteksi Atap Bangunan Berbasis Citra Udara Menggunakan Google Colab dan Algoritma Deep Learning YOLOv7. Jurnal Manajemen Sistem Informasi (JMASIF), 2(1), 9–18. https://doi.org/10.59431/jmasif.v2i1.156

Mulyadi, I. P. (2022). Klasterisasi Menggunakan Metode Algoritma K-Means dalam Meningkatkan Penjualan Tupperware. Jurnal Informatika Ekonomi Bisnis, 4, 172–179. https://doi.org/10.37034/infeb.v4i4.164

Noperahila, N. R., & Sulianta, F. (2024). Analisis Pola Perilaku Konsumen dan Kebiasaan Belanja menggunakan Metode K-Means Clustering. July. https://www.kaggle.com/datasets/zeesolver/consumer-behavior-and-

Nur Rohim, & Zuliarso, E. (2022). Penerapan Algoritma Deep Learning Untuk Pengembangan Chatbot Yang Digunakan Untuk Konsultasi Dan Pengenalan Tentang Virus Covid-19. Pixel?:Jurnal Ilmiah Komputer Grafis, 15(2), 267–278. https://doi.org/10.51903/pixel.v15i2.777

Oti, E. U., Olusola, M. O., Eze, F. C., & Enogwe, S. U. (2021). Comprehensive Review of K-Means Clustering Algorithms. International Journal of Advances in Scientific Research and Engineering, 07(08), 64–69. https://doi.org/10.31695/ijasre.2021.34050

Permata Sari, S. (2020). Strategi Meningkatkan Penjualan Di Era Digital. SCIENTIFIC JOURNAL OF REFLECTION: Economic, Accounting, Management and Business, 3(3), 291–300. https://doi.org/10.5281/zenodo.3930698

Plotnikova, V., Dumas, M., & Milani, F. (2021). Adapting the CRISP-DM Data Mining Process: A Case Study in the Financial Services Domain. Lecture Notes in Business Information Processing, 415 LNBIP, 55–71. https://doi.org/10.1007/978-3-030-75018-3_4

Ramanto, A., Irma Purnamasari, A., & Ali, I. (2024). Analisis Pola Pembelian Produk Pada Toko Online Daun Indah Menggunakan Association Rule Dan Algoritma Fp-Growth Di Platform E-Commerce Shopee. JATI (Jurnal Mahasiswa Teknik Informatika), 8(1), 1215–1220. https://doi.org/10.36040/jati.v8i1.8341

Safitri, E. (2024). Implementasi Algoritma K-Means Clustering Dalam Menentukan Strategi Marketing Dalam Penjualan Ikan (Studi Kasus: Grosir Ikan Tani Mas Tanjung Morawa). JIKTEKS?: Jurnal Ilmu Komputer Dan Teknologi Informasi, 02(02), 23–33.

Schroer, C., Kruse, F., & Gómez, J. M. (2021). A systematic literature review on applying CRISP-DM process model. Procedia Computer Science, 181(2019), 526–534. https://doi.org/10.1016/j.procs.2021.01.199

Sekar Setyaningtyas, Indarmawan Nugroho, B., & Arif, Z. (2022). Tinjauan Pustaka Sistematis: Penerapan Data Mining Teknik Clustering Algoritma K-Means. Jurnal Teknoif Teknik Informatika Institut Teknologi Padang, 10(2), 52–61. https://doi.org/10.21063/jtif.2022.v10.2.52-61

Valaskova, K., Durana, P., & Adamko, P. (2021). Changes in consumers’ purchase patterns as a consequence of the COVID-19 pandemic. Mathematics, 9(15), 1–17. https://doi.org/10.3390/math9151788

Wahono, R. S. (2023). Data Mining Data mining. In Mining of Massive Datasets (Vol. 2, Issue January 2013). https://www.cambridge.org/core/product/identifier/CBO9781139058452A007/type/book_part

Downloads

Published

2025-08-14

How to Cite

Tjia, T. E., Yasir, F. N., & Ekawati, S. (2025). Implementation of Data Mining for Analyzing Consumer Purchasing Patterns at TeTa Ino Cafe. Brilliance: Research of Artificial Intelligence, 5(2), 751–760. https://doi.org/10.47709/brilliance.v5i2.6767

Similar Articles

1 2 3 4 5 6 7 8 9 10 > >> 

You may also start an advanced similarity search for this article.