Comparative Unsupervised Clustering Approaches for Customer Segmentation

Asmin Alev Aktas, Okan Tunali, Ahmet Tugrul Bayrak
{"title":"Comparative Unsupervised Clustering Approaches for Customer Segmentation","authors":"Asmin Alev Aktas, Okan Tunali, Ahmet Tugrul Bayrak","doi":"10.1109/CDS52072.2021.00097","DOIUrl":null,"url":null,"abstract":"Machine learning-driven studies to get potent insights about customers are essential for the business world to grow as they achieve smarter in marketing and sales activities. Finding the consociate patterns of customer interaction activities leads to finding sensible segments. By this, strategists can reach out to different groups of customers with customized services, offers and plans. However, although clustering algorithms are reliable by virtue of them being competent studies, not all of them fit the studied domain. In this study, six well-known clustering algorithms with different parameters are applied to real-life customer purchase history data. The outcomes are compared, and the density distribution of data features in created clusters are visualized. Thus, it is possible to see the role of each selected feature on the differentiation of clusters. The cluster labels of data points (customers) are mapped in pairs of algorithms. As a result, the similarities and differences in clusters created by different algorithms are more straightforward to catch. Moreover, in addition to labeling data points with class labels, a hybrid approach is presented to obtain information about class label probabilities by fitting the support vector classification model. The proposed study gives promising results in understanding how different clustering algorithms fit the customer data and stands out with multi-sides evaluation and comparison experiments.","PeriodicalId":380426,"journal":{"name":"2021 2nd International Conference on Computing and Data Science (CDS)","volume":"100 22","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Conference on Computing and Data Science (CDS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDS52072.2021.00097","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Machine learning-driven studies to get potent insights about customers are essential for the business world to grow as they achieve smarter in marketing and sales activities. Finding the consociate patterns of customer interaction activities leads to finding sensible segments. By this, strategists can reach out to different groups of customers with customized services, offers and plans. However, although clustering algorithms are reliable by virtue of them being competent studies, not all of them fit the studied domain. In this study, six well-known clustering algorithms with different parameters are applied to real-life customer purchase history data. The outcomes are compared, and the density distribution of data features in created clusters are visualized. Thus, it is possible to see the role of each selected feature on the differentiation of clusters. The cluster labels of data points (customers) are mapped in pairs of algorithms. As a result, the similarities and differences in clusters created by different algorithms are more straightforward to catch. Moreover, in addition to labeling data points with class labels, a hybrid approach is presented to obtain information about class label probabilities by fitting the support vector classification model. The proposed study gives promising results in understanding how different clustering algorithms fit the customer data and stands out with multi-sides evaluation and comparison experiments.
客户细分的比较无监督聚类方法
机器学习驱动的研究,以获得对客户的有效洞察,对于商业世界的发展至关重要,因为他们在营销和销售活动中实现了更智能的发展。发现客户交互活动的关联模式可以找到合理的细分。通过这种方式,战略家可以接触到不同的客户群体,提供定制的服务、优惠和计划。然而,虽然聚类算法是可靠的,因为它们是称职的研究,但并不是所有的聚类算法都适合所研究的领域。在本研究中,六种众所周知的不同参数的聚类算法被应用于现实生活中的客户购买历史数据。将结果进行比较,并将创建的聚类中数据特征的密度分布可视化。因此,可以看到每个选择的特征在集群分化中的作用。数据点(客户)的聚类标签以算法对的方式映射。因此,由不同算法创建的聚类的相似性和差异性更容易捕捉。此外,除了用类标签标注数据点外,还提出了一种混合方法,通过拟合支持向量分类模型获得类标签概率信息。该研究在理解不同聚类算法如何适合客户数据方面取得了可喜的成果,并在多方评估和比较实验中脱颖而出。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信