Improved Multi-index Customer Segmentation Model Research

Wolfgang Bellotti, D. Davies, Y. H. Wang
{"title":"Improved Multi-index Customer Segmentation Model Research","authors":"Wolfgang Bellotti, D. Davies, Y. H. Wang","doi":"10.21742/ijsbt.2021.9.2.04","DOIUrl":null,"url":null,"abstract":"Customer segmentation helps the company's strategy formulation and competitiveness enhancement. To better meet customer needs and preferences, companies must recognize the differences of customers and formulate precise marketing strategies. This article focuses on the current customer segmentation background and combines Data mining tools, proposed a multi-index customer segmentation model. Considering the micro and macro perspectives, the traditional indicators are refined, and new segmentation indicators are added. The indicators are weighted by the entropy method. To reduce the time complexity of clustering, factor analysis is used to reduce the data dimension. Finally, the improved K-means clustering algorithm is used to optimize the determination of the K value and the selection of the initial center point to determine the customer segmentation results. The empirical research results on the segmentation of a retailer's membership data show that the improved algorithm is superior to the classic customer segmentation method in terms of clustering compactness and feature division capabilities. With this, it can help companies to improve the level of customer relationship management and the quality of decision-making.","PeriodicalId":448069,"journal":{"name":"International Journal of Smart Business and Technology","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Smart Business and Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21742/ijsbt.2021.9.2.04","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Customer segmentation helps the company's strategy formulation and competitiveness enhancement. To better meet customer needs and preferences, companies must recognize the differences of customers and formulate precise marketing strategies. This article focuses on the current customer segmentation background and combines Data mining tools, proposed a multi-index customer segmentation model. Considering the micro and macro perspectives, the traditional indicators are refined, and new segmentation indicators are added. The indicators are weighted by the entropy method. To reduce the time complexity of clustering, factor analysis is used to reduce the data dimension. Finally, the improved K-means clustering algorithm is used to optimize the determination of the K value and the selection of the initial center point to determine the customer segmentation results. The empirical research results on the segmentation of a retailer's membership data show that the improved algorithm is superior to the classic customer segmentation method in terms of clustering compactness and feature division capabilities. With this, it can help companies to improve the level of customer relationship management and the quality of decision-making.
改进的多指标客户细分模型研究
客户细分有助于公司战略的制定和竞争力的提升。为了更好地满足顾客的需求和偏好,企业必须认识到顾客的差异,制定精准的营销策略。本文针对当前客户细分的背景,结合数据挖掘工具,提出了一个多指标客户细分模型。从微观和宏观两方面考虑,对传统指标进行细化,增加新的细分指标。采用熵权法对指标进行加权。为了降低聚类的时间复杂度,采用因子分析对数据进行降维。最后,利用改进的K-means聚类算法对K值的确定和初始中心点的选取进行优化,确定客户细分结果。对某零售商会员数据进行分割的实证研究结果表明,改进算法在聚类紧密度和特征分割能力方面都优于经典的顾客分割方法。从而可以帮助企业提高客户关系管理水平和决策质量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信