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.

LRFMVD : a customer segmentation model

Citation

Abstract

Customer segmentation is a big part of the superstore industry. Traditionally, the RFM model has been used to segment customers to maximize profit. This work proposes a new customer segmentation named LRFMVD based on RFM and LRFMV models in hopes of providing a more sure-fire way of segmenting customers. The k-means clustering method will be used for the proposed model. The clusters created by K-means are then analyzed using the LRFMVD model to find a correlation between profit and volume. Many works have been done previously on customer segmentation for maximizing profit, but none of those were able to show a straightforward representation of profit, volume, and discounts on products. Unsupervised learning was used to investigate the correlations between volume, discount, and profit. Customers are then segmented using the Customer Classification Matrix, which looks at the properties of all clusters. The L, R, F, M, VD parameters’ values are compared to the cluster mean values, and based on whether these values are higher or lower than the average, customers are segmented. Comparisons among the three models reveal that the latter provides more profit per head than the other two, and is able to identify customers who cause superstores to lose money or make a loss.

Description

Cataloged from PDF version of thesis.
Includes bibliographical references (pages 35-39).
This thesis is submitted in partial fulfillment of the requirements for the degree of Bachelor of Science in Computer Science, 2023.

Publisher Link

Type

Thesis