Segmentasi Pelanggan Berdasarkan Model LRFM Menggunakan Algoritma K-Means dan Optimasi Klaster Dinamis

Riyan Wahyudi, Achmad Solihin

Abstract


The number of tax training participants often does not meet the minimum quota, resulting in the cancellation of many training classes. Throughout 2022, there were 27 training classes that failed to take place due to a lack of participants. One of the reasons is that promotions have not utilised historical customer data to set marketing targets more precisely. By utilising historical customer data, companies can design more targeted promotional strategies and increase the number of training participants. Therefore, this research aims to segment customers using the dynamic K-Means algorithm based on the Length, Recency, Frequency, and Monetary (LRFM) model, so that customer behaviour patterns when registering for training can be identified. The clustering results are then visualised to facilitate analysis and decision-making. This research resulted in three customer segments, namely Loyal customers (Gold, 17%), Lost customers (Diamond, 64%), and New customers (Silver, 17%). With this segmentation, it is expected that the company can conduct more effective promotions and increase the number of trainees in the future.

Keywords


Data Mining; Customer Segmentation; K-Means; Model LRFM.

Full Text:

References


A. Dhini, L. R. Budiani, and E. Laoh, “Segmenting and Targeting the Potential Markets of a Muslim Fashion Company,” in 7th International Conference on ICT for Smart Society: AIoT for Smart Society, ICISS 2020 - Proceeding, Institute of Electrical and Electronics Engineers Inc., Nov. 2020. doi: 10.1109/ICISS50791.2020.9307604.

M. Alvandi, S. Fazli, and F. S. Abdoli, “K-Mean Clustering Method For Analysis Customer Lifetime Value With LRFM Relationship Model In Banking Services,” International Research Journal of Applied and Basic Sciences, 2012, [Online]. Available: www.irjabs.com

N. Fitrianti Fahrudin and R. Rindiyani, “Comparison of K-Medoids and K-Means Algorithms in Segmenting Customers based on RFM Criteria,” E3S Web of Conferences, vol. 484, p. 02008, Feb. 2024, doi: 10.1051/e3sconf/202448402008.

K. Auliasari and M. Kertaningtyas, “Penerapan Algoritma K-Means untuk Segmentasi Konsumen Menggunakan R,” Jurnal Teknologi dan Manajemen Informatika, vol. 5, no. 2, Dec. 2019, doi: 10.26905/jtmi.v5i2.3644.

Y. P. Anggodo, W. Cahyaningrum, A. N. Fauziyah, I. L. Khoiriyah, O. Kartikasari, and I. Cholissodin, “Hybrid K-means Dan Particle Swarm Optimization Untuk Clustering Nasabah Kredit,” Jurnal Teknologi Informasi dan Ilmu Komputer, vol. 4, no. 2, p. 104, May 2017, doi: 10.25126/jtiik.201742303.

M. Aryuni, E. Didik Madyatmadja, and E. Miranda, “Customer Segmentation in XYZ Bank Using K-Means and K-Medoids Clustering,” in 2018 International Conference on Information Management and Technology (ICIMTech), IEEE, Sep. 2018, pp. 412–416. doi: 10.1109/ICIMTech.2018.8528086.

Z.-J. Lee, C.-Y. Lee, L.-Y. Chang, and N. Sano, “Clustering and Classification Based on Distributed Automatic Feature Engineering for Customer Segmentation,” Symmetry (Basel), vol. 13, no. 9, p. 1557, Aug. 2021, doi: 10.3390/sym13091557.

M. Tavakoli, M. Molavi, V. Masoumi, M. Mobini, S. Etemad, and R. Rahmani, “Customer Segmentation and Strategy Development Based on User Behavior Analysis, RFM Model and Data Mining Techniques: A Case Study,” in 2018 IEEE 15th International Conference on e-Business Engineering (ICEBE), IEEE, Oct. 2018, pp. 119–126. doi: 10.1109/ICEBE.2018.00027.

J. Zhou, J. Wei, and B. Xu, “Customer segmentation by web content mining,” Journal of Retailing and Consumer Services, vol. 61, p. 102588, Jul. 2021, doi: 10.1016/j.jretconser.2021.102588.

A. Solichin and G. Wibowo, “Customer Segmentation Based on Recency Frequency Monetary (RFM) and User Event Tracking (UET) Using K-Means Algorithm,” in 2022 IEEE 8th Information Technology International Seminar (ITIS), IEEE, Oct. 2022, pp. 257–262. doi: 10.1109/ITIS57155.2022.10009981.

S. Peker, A. Kocyigit, and P. E. Eren, “LRFMP model for customer segmentation in the grocery retail industry: a case study,” Marketing Intelligence & Planning, vol. 35, no. 4, pp. 544–559, May 2017, doi: 10.1108/MIP-11-2016-0210.

H. Astuti, “Penerapan Data Mining Menggunakan Metode K-Means Clustering Untuk Pengelompokkan Data Pelanggan (Studi Kasus : PT. Pinus Merah Abadi),” 2021.

Md. Z. Hossain, Md. N. Akhtar, R. B. Ahmad, and M. Rahman, “A dynamic K-means clustering for data mining,” Indonesian Journal of Electrical Engineering and Computer Science, vol. 13, no. 2, p. 521, Feb. 2019, doi: 10.11591/ijeecs.v13.i2.pp521-526.

M. R. K. Ibrahim and R. Tyasnurita, “LRFM Model Analysis for Customer Segmentation Using K-Means Clustering,” in 2022 International Conference on Electrical and Information Technology (IEIT), IEEE, Sep. 2022, pp. 383–391. doi: 10.1109/IEIT56384.2022.9967896.

H. Soetanto, Rusdah, Painem, and Ameliana, “Reseller Segmentation for a Strategy to Increase The Purchase Deposit of a Telecommunications Company Using The LRFM and K-Means Algorithm,” in 2023 6th International Seminar on Research of Information Technology and Intelligent Systems (ISRITI), IEEE, Dec. 2023, pp. 180–185. doi: 10.1109/ISRITI60336.2023.10467378.

H. P. Kurniawan and L. Farhatuaini, “Identifikasi Pola Kepuasan Mahasiswa Terhadap Proses Pembelajaran Menggunakan Algoritma K-Means Clustering.,” Jurnal Informatika: Jurnal Pengembangan IT, vol. 9, no. 2, pp. 164–172, Aug. 2024, doi: 10.30591/jpit.v9i2.6740.

E. Bakhshizadeh, H. Aliasghari, R. Noorossana, and R. Ghousi, “Customer Clustering Based on Factors of Customer Lifetime Value with Data Mining Technique (Case Study: Software Industry),” International Journal of Industrial Engineering and Production Research, vol. 33, no. 1, Mar. 2022, doi: 10.22068/ijiepr.33.1.1.




DOI: https://doi.org/10.30591/jpit.v10i3.8735

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.

JPIT INDEXED BY

  
  

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.