Three-Layer Data Clustering Model for Multi-View Customer Segmentation using K-Means
-
Published:2020-03-30
Issue:6
Volume:8
Page:1840-1846
-
ISSN:2277-3878
-
Container-title:International Journal of Recent Technology and Engineering
-
language:en
-
Short-container-title:IJRTE
Abstract
Customer Relationship Management (CRM) system is one of the methods to increase customer satisfaction with the services provided by the company. The data in a CRM system sometimes have not been utilized properly to find specific information about customer needs. The data mining process can help companies to segment and retrieve useful information about customers. The segmentation of customers can be categorized into groups based on the RFM (Recency, Frequency, and Monetary) values of the customers. Several studies have used the RFM model as a basis for customer segmentation. However, the methods proposed in previous studies are very specific to certain industries and the range of RFM scores used is also very subjective. Also, as the business grows there are challenges with RFM score measurement. RFM score measurement needs frequent adjustments in which this adjustment is not easy using the existing methods. Therefore, this study proposed a novel method to overcome the limitation of the existing methods using combined K-Means and Davies-Bouldin Index (DBI) to find the appropriate range of RFM scores. Based on our study in a telecommunication industry the proposed method simplify the measurement of the RMF scores as the data grows. This research also provided the appropriate RFM score range through the K-Means approach based on the optimal K value of the K-Means algorithm. Our proposed method could be implemented in other industries since it only depends on the values of RFM from the correspond data for each customer.
Publisher
Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
Subject
Management of Technology and Innovation,General Engineering
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献