The Application of Customers Segmentation Using RFM Analysis Method and K-Means Clustering to Improve Marketing Strategy

Salahudin Robo(1*), Putri Indah Melani(2), Patrisia Fernatyanan(3), Muh Riandi Widiantoro(4), Sitti Khairul Bariyyah(5),

(1) Universitas Yapis Papua, Jayapura, Indonesia
(2) Universitas Yapis Papua, Jayapura, Indonesia
(3) Universitas Yapis Papua, Jayapura, Indonesia
(4) Universitas Yapis Papua, Jayapura, Indonesia
(5) Universitas Yapis Papua, Jayapura, Indonesia
(*) Corresponding Author

Abstract


This research aims to overcome problems in improving marketing strategies in the Retail Business industry by using effective customer segmentation. The method used is RFM (Recency, Frequency, Monetary) analysis to measure the time proximity, frequency and monetary value of customer transactions, as well as K-Means Clustering to group customers based on their purchasing behavior. The results showed that the combination of these two methods successfully grouped customers into ten different segments, such as “Champions” and “Hibernating,” which provided deep insight into customer needs and behavior. The application of this segmentation provides practical benefits in increasing the efficiency of marketing strategies, customer retention and resource optimization. Overall, this research proves that applied customer segmentation techniques can significantly increase customer satisfaction and loyalty, making a valuable contribution to the field of retail marketing.

Full Text:

PDF

References


S. F. Salem And A. B. Alanadoly, “Driving Customer Engagement And Citizenship Behaviour In Omnichannel Retailing: Evidence From The Fashion Sector,” Spanish J. Mark. - Esic, Vol. 28, No. 1, Pp. 98–122, 2024, Doi: 10.1108/Sjme-10-2022-0220.

K. Hameli, “A Literature Review Of Retailing Sector And Business Retailing Types,” Ilir. Int. Rev., Vol. 8, Jul. 2018, Doi: 10.21113/Iir.V8i1.386.

J. M. John, O. Shobayo, And B. Ogunleye, “An Exploration Of Clustering Algorithms For Customer Segmentation In The Uk Retail Market,” Analytics, Vol. 2, No. 4, Pp. 809–823, 2023, Doi: 10.3390/Analytics2040042.

Samidi, R. Y. Suladi, And D. Kusumaningsih, “Comparison Of The Rfm Model’s Actual Value And Score Value For Clustering,” J. Resti (Rekayasa Sist. Dan Teknol. Informasi), Vol. 7, No. 6, Pp. 1430–1438, 2023, Doi: 10.29207/Resti.V7i6.5416.

Emigawaty, K. Adi, A. F. Rochim, B. Warsito, And A. Wibowo, “K-Means Clustering Algorithm For Partitioning The Openness Levels Of Open Government Data Portals,” Int. J. Informatics Vis., Vol. 7, No. 3, Pp. 977–983, 2023, Doi: 10.30630/Joiv.7.3.1761.

R. Ananda And A. Prasetiadi, “Hierarchical And K-Means Clustering In The Line Drawing Data Shape Using Procrustes Analysis,” Int. J. Informatics Vis., Vol. 5, No. 3, Pp. 306–312, 2021, Doi: 10.30630/Joiv.5.3.532.

M. Izadikhah, R. Farzipoor Saen, K. Ahmadi, And M. Shamsi, “How To Use Fuzzy Screening System And Data Envelopment Analysis For Clustering Sustainable Suppliers? A Case Study In Iran,” J. Enterp. Inf. Manag., Vol. 34, No. 1, Pp. 199–229, 2020, Doi: 10.1108/Jeim-09-2019-0262.

B. Charbuty And A. Abdulazeez, “Classification Based On Decision Tree Algorithm For Machine Learning,” J. Appl. Sci. Technol. Trends, Vol. 2, No. 01, Pp. 20–28, 2021, Doi: 10.38094/Jastt20165.

E. Wang Yan, A. Jian, L. Yan, And W. Honggang, “Optimization Of K-Medoids Algorithm For Initial Clustering Center,” J. Phys. Conf. Ser., Vol. 1487, No. 1, 2020, Doi: 10.1088/1742-6596/1487/1/012011.

S. Liu, “An Improved K-Means Clustering Based On Differential Evolution,” J. Phys. Conf. Ser., Vol. 2595, No. 1, Pp. 1–7, 2023, Doi: 10.1088/1742-6596/2595/1/012010.

M. Shutaywi And N. N. Kachouie, “Silhouette Analysis For Performance Evaluation In Machine Learning With Applications To Clustering,” Entropy, Vol. 23, No. 6, Pp. 1–17, 2021, Doi: 10.3390/E23060759.

C. Schröer, F. Kruse, And J. M. Gómez, “A Systematic Literature Review On Applying Crisp-Dm Process Model,” Procedia Comput. Sci., Vol. 181, No. 2019, Pp. 526–534, 2021, Doi: 10.1016/J.Procs.2021.01.199.

S. Chavhan, “R F M A N A Ly S I S F O R C U S T O M E R Segme N Tatio N Usi N G Machi N E Lear N I N G : A Survey Of A Decade Of Research,” Vol. 11, No. December, Pp. 166–173, 2022.

I. Karacan, I. Erdogan, And U. Cebeci, “A Comprehensive Integration Of Rfm Analysis, Cluster Analysis, And Classification For B2b Customer Relationship Management,” Proc. Int. Conf. Ind. Eng. Oper. Manag., Pp. 497–508, 2021.

A. Gülcü And S. Çalişkan, “Clustering Electricity Market Participants Via Frm Models,” Intell. Decis. Technol., Vol. 14, No. 4, Pp. 481–492, 2020, Doi: 10.3233/Idt-200092.

I. Huda, A. A. Suhendra, And M. A. Bijaksana, “Design Of Prediction Model Using Data Mining For Segmentation And Classification Customer Churn In E-Commerce Mall In Mall,” Int. J. Informatics Vis., Vol. 7, No. 4, Pp. 2280–2289, 2023, Doi: 10.30630/Joiv.7.4.2414.

C. Yuan And H. Yang, “Research On K-Value Selection Method Of K-Means Clustering Algorithm,” J, Vol. 2, No. 2, Pp. 226–235, 2019, Doi: 10.3390/J2020016.

M. Harahap, A. W. D. R. Zamili, M. A. Arvansyah, E. F. Saragih, S. Rajen, And A. M. Husein, “K-Means Clustering Algorithm Approach In Clustering Data On Cocoa Production Results In The Sumatra Region,” J. Resti (Rekayasa Sist. Dan Teknol. Informasi), Vol. 6, No. 6, Pp. 905–910, 2022, Doi: 10.29207/Resti.V6i6.4199.

V. H. Antonius And D. Fitrianah, “Enhancing Customer Segmentation Insights By Using Rfm + Discount Proportion Model With Clustering Algorithms,” Int. J. Adv. Comput. Sci. Appl., Vol. 15, No. 3, Pp. 902–911, 2024, Doi: 10.14569/Ijacsa.2024.0150390.

W. Chang Et Al., “Analysis Of University Students’ Behavior Based On A Fusion K-Means Clustering Algorithm,” Appl. Sci., Vol. 10, No. 18, 2020, Doi: 10.3390/App10186566.

A. Sharma, S. Vishwakarma, And A. K. Dubey, “Enhancing Data Analysis Through K-Means With Foggy Centroid Selection,” Int. J. Adv. Comput. Res., Vol. 13, No. 64, Pp. 55–62, 2023, Doi: 10.19101/Ijacr.2023.1362018.

Z. Rahman, M. S. Hossain, M. Hasan, And A. Imteaj, “An Enhanced Method Of Initial Cluster Center Selection For K-Means Algorithm,” Proc. - 2021 Innov. Intell. Syst. Appl. Conf. Asyu 2021, 2021, Doi: 10.1109/Asyu52992.2021.9599017.




DOI: https://doi.org/10.30645/ijistech.v8i3.370

Refbacks

  • There are currently no refbacks.







Jumlah Kunjungan:

View My Stats

Published Papers Indexed/Abstracted By: