Building of Informatics, Technology and Science
Vol 6 No 2 (2024): September 2024

Penerapan Algoritma K-Medoids dan FP-Growth dengan Model RFM untuk Kombinasi Produk

Pertiwi, Tata Ayunita (Unknown)
Afdal, M. (Unknown)
Novita, Rice (Unknown)
Mustakim, Mustakim (Unknown)



Article Info

Publish Date
09 Sep 2024

Abstract

Competition in the business world has increased, resulting in companies having to optimize sales and retain their customers. Customers are an important company asset that must be well looked after. The aim of customer segmentation is to understand customer purchasing behavior so that companies can implement appropriate marketing strategies. Aurel Mini Mart is a retail business that does not yet consider the recency, frequency and monetary value of customer shopping. So far, promotions have been carried out only based on estimates, without taking into account accurate data and information. This research combines the RFM model with data mining techniques to segment customers. Based on the 5 clusters formed from the clustering process, gold customers are in cluster 1 which has high loyalty with low recency value, high frequency and high monetary value. This shows that customers in this segment often make purchases for quite large amounts of money. Meanwhile, customers in clusters 2, 3, 4, and 5 are dormant customers who rarely make transactions and the amount of money spent is also small. After the customer segmentation process is complete, the next step is to use the FP-Growth Algorithm to associate the products purchased by customers. This aims to obtain a better product combination, so that the sales strategy can be more effective and the company can make a profit.

Copyrights © 2024






Journal Info

Abbrev

bits

Publisher

Subject

Computer Science & IT

Description

Building of Informatics, Technology and Science (BITS) is an open access media in publishing scientific articles that contain the results of research in information technology and computers. Paper that enters this journal will be checked for plagiarism and peer-rewiew first to maintain its quality. ...