Welcome to the upgraded BRAC University Institutional Repository. We are currently organizing collections after a recent system upgrade. Homepage category counters may temporarily show lower numbers while syncing, but over 27,000 repository items remain safe and accessible. Please use the search bar to find theses, scholarly outputs, and institutional documents.

LRFMV: an efficient customer segmentation model for superstores

Citation

Abstract

In superstore business, the recency, frequency, and monetary (RFM) based on cus tomers’ purchase results is preferred to categorize valuable customers in order to increase profit margins. This paper develops an enhanced RFM (recency, fre quency, monetary) and LRFM (length, recency, frequency, monetary) model, namely LRFMV (length, recency, frequency, monetary, and volume), and then clusters the data using the standard K-means, K-medoids and Mini Batch K-means algorithms. The results obtained from the three algorithms are compared and the K-means al gorithm is chosen for the superstore dataset of the proposed LRFMV model. All clusters created using these three algorithms are evaluated in the LRFMV model and a close relationship between profit and volume is observed. A clear profit-quantity relationship of items has yet not been seen in any prior study on the RFM and LRFM models. Grouping customers aiming at the profit maximization existed previously but there were no clear and direct depiction of profit and quantity of sold items. To establish a relationship between volume and profit, this study applied unsuper vised machine learning to investigate the patterns, trends, and correlations between these two variables. The traits of all the clusters are analyzed by the Customer Classification Matrix. The values of LRFMV variables that are larger or less than the overall average for each cluster are identified and utilised as their traits. The RFM model, the LRFM model and the suggested LRFMV model are compared, and the outcome indicates that the LRFMV model may create more segments with the same number of customers while maintaining a greater profit per head.

Description

Cataloged from PDF version of thesis.
Includes bibliographical references (pages 71-75).
This thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science and Engineering, 2021.

Publisher Link

Type

Thesis