HC-means clustering algorithm for precision marketing on e-commerce platforms

IF 3.6
Dan Wu, Xin Liu
{"title":"HC-means clustering algorithm for precision marketing on e-commerce platforms","authors":"Dan Wu,&nbsp;Xin Liu","doi":"10.1016/j.sasc.2025.200236","DOIUrl":null,"url":null,"abstract":"<div><div>With the rapid development of e-commerce industry, precision marketing has become a key means for enterprises to enhance competitiveness and profitability. However, traditional marketing methods often cannot accurately identify the characteristics of customers, leading to the waste of e-commerce resources. In this context, e-commerce enterprises urgently need a more accurate and efficient marketing method to meet the growing business needs. To this end, this study attempts to optimize the traditional K-means algorithm, and fundamentally improve the clustering effect in precision marketing by optimizing the selection of initial clustering centers and similarity measurement methods. Based on this, the research constructs an e-commerce marketing system based on HC-means algorithm to more accurately divide customer groups, identify high-value customers, potential customers and lost customers, and formulate differentiated marketing strategies for different groups. Experiments show that the average accuracy of HC-means algorithm in Glass database is 93.71, which is 15.48–15.79 higher than the highest accuracy of other two kinds of algorithms in the same kind of database. When the cluster number is 8, the Mahalanobis distance of HC-Means is reduced by 2.1 and 1.2 respectively compared with K-means and DBSCAN, which indicates that the clustering results are more reasonable in data distribution. When the cluster number is 3, more than half of the customers' consumption interval days are mainly concentrated between 8–12 days, and about 10 % of the customers make purchases every 2 days. These accurate customer behavior insights provide a strong basis for marketing strategy development. To sum up, the HC-Means system constructed by the research has achieved remarkable results in e-commerce precision marketing, greatly improving user satisfaction, and providing a valuable reference scheme for e-commerce enterprises to optimize marketing mode and achieve sustainable development.</div></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"7 ","pages":"Article 200236"},"PeriodicalIF":3.6000,"publicationDate":"2025-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Systems and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772941925000547","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the rapid development of e-commerce industry, precision marketing has become a key means for enterprises to enhance competitiveness and profitability. However, traditional marketing methods often cannot accurately identify the characteristics of customers, leading to the waste of e-commerce resources. In this context, e-commerce enterprises urgently need a more accurate and efficient marketing method to meet the growing business needs. To this end, this study attempts to optimize the traditional K-means algorithm, and fundamentally improve the clustering effect in precision marketing by optimizing the selection of initial clustering centers and similarity measurement methods. Based on this, the research constructs an e-commerce marketing system based on HC-means algorithm to more accurately divide customer groups, identify high-value customers, potential customers and lost customers, and formulate differentiated marketing strategies for different groups. Experiments show that the average accuracy of HC-means algorithm in Glass database is 93.71, which is 15.48–15.79 higher than the highest accuracy of other two kinds of algorithms in the same kind of database. When the cluster number is 8, the Mahalanobis distance of HC-Means is reduced by 2.1 and 1.2 respectively compared with K-means and DBSCAN, which indicates that the clustering results are more reasonable in data distribution. When the cluster number is 3, more than half of the customers' consumption interval days are mainly concentrated between 8–12 days, and about 10 % of the customers make purchases every 2 days. These accurate customer behavior insights provide a strong basis for marketing strategy development. To sum up, the HC-Means system constructed by the research has achieved remarkable results in e-commerce precision marketing, greatly improving user satisfaction, and providing a valuable reference scheme for e-commerce enterprises to optimize marketing mode and achieve sustainable development.
电子商务平台精准营销的HC-means聚类算法
随着电子商务行业的快速发展,精准营销已经成为企业提升竞争力和盈利能力的关键手段。然而,传统的营销方法往往不能准确识别客户的特征,导致电子商务资源的浪费。在此背景下,电子商务企业迫切需要一种更加精准高效的营销方式来满足日益增长的业务需求。为此,本研究试图对传统的K-means算法进行优化,通过优化初始聚类中心的选择和相似性度量方法,从根本上提高精准营销中的聚类效果。在此基础上,本研究构建了基于HC-means算法的电子商务营销体系,更准确地划分客户群体,识别高价值客户、潜在客户和流失客户,并针对不同群体制定差异化营销策略。实验表明,HC-means算法在Glass数据库中的平均准确率为93.71,比同类数据库中其他两种算法的最高准确率高出15.48 ~ 15.79。当聚类数为8时,HC-Means的Mahalanobis距离比K-means和DBSCAN分别减小2.1和1.2,表明聚类结果在数据分布上更为合理。当聚类数为3时,超过一半的客户的消费间隔天数主要集中在8-12天之间,约10%的客户每2天购买一次。这些准确的客户行为洞察为营销策略的制定提供了强有力的基础。综上所述,本研究构建的HC-Means系统在电子商务精准营销中取得了显著的效果,极大地提高了用户满意度,为电子商务企业优化营销模式,实现可持续发展提供了有价值的参考方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
2.20
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信