Data Mining Approach for Customer Segmentation in B2B Settings using Centroid-Based Clustering

Nadhira Riska Maulina, I. Surjandari, A. M. M. Rus
{"title":"Data Mining Approach for Customer Segmentation in B2B Settings using Centroid-Based Clustering","authors":"Nadhira Riska Maulina, I. Surjandari, A. M. M. Rus","doi":"10.1109/ICSSSM.2019.8887739","DOIUrl":null,"url":null,"abstract":"Big data and advanced analytics in organizations are dominant in customer-centric departments such as marketing, sales, and customer service. For company, designing marketing strategies using customer segmentation is useful to improve business revenue. Clustering algorithms able to deal with large data set to recognize patterns and identify customer segments. In this paper, different clustering algorithms will be compared, specifically centroid-based clustering K-Means, CLARA, and PAM with Fuzzy C-Means clustering. The purpose of this research is to find optimum number of clusters using clustering algorithm with the best validation measure score. Dataset is acquired from Tech Company in Indonesia that provide machine with Point of Sale system for food and beverages merchants, since the company in B2B settings. Among three clustering methods, K-Means have the best validation measure score. After compared to Fuzzy C-Means, K-Means outperforms FCM based on time complexity and quality of clustering. Cluster analysis is done to identify customer information. Therefore, this research able to deliver an insightful understanding about customer characteristics using big data analytics and provide an effective Customer Relationship Management Systems.","PeriodicalId":442421,"journal":{"name":"2019 16th International Conference on Service Systems and Service Management (ICSSSM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 16th International Conference on Service Systems and Service Management (ICSSSM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSSSM.2019.8887739","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Big data and advanced analytics in organizations are dominant in customer-centric departments such as marketing, sales, and customer service. For company, designing marketing strategies using customer segmentation is useful to improve business revenue. Clustering algorithms able to deal with large data set to recognize patterns and identify customer segments. In this paper, different clustering algorithms will be compared, specifically centroid-based clustering K-Means, CLARA, and PAM with Fuzzy C-Means clustering. The purpose of this research is to find optimum number of clusters using clustering algorithm with the best validation measure score. Dataset is acquired from Tech Company in Indonesia that provide machine with Point of Sale system for food and beverages merchants, since the company in B2B settings. Among three clustering methods, K-Means have the best validation measure score. After compared to Fuzzy C-Means, K-Means outperforms FCM based on time complexity and quality of clustering. Cluster analysis is done to identify customer information. Therefore, this research able to deliver an insightful understanding about customer characteristics using big data analytics and provide an effective Customer Relationship Management Systems.
基于质心聚类的B2B客户细分数据挖掘方法
组织中的大数据和高级分析在以客户为中心的部门(如营销、销售和客户服务)中占主导地位。对于公司来说,利用客户细分来设计营销策略对提高业务收入是有用的。聚类算法能够处理大数据集来识别模式和识别客户细分。本文将比较不同的聚类算法,特别是基于质心的聚类K-Means、CLARA和PAM与模糊C-Means聚类。本研究的目的是使用具有最佳验证度量得分的聚类算法找到最优聚类数量。数据集是从印度尼西亚的Tech公司收购的,该公司为食品和饮料商家提供机器与销售点系统,因为该公司处于B2B环境中。在三种聚类方法中,K-Means具有最好的验证测度得分。与模糊C-Means相比,K-Means在时间复杂度和聚类质量上优于FCM。通过聚类分析来识别客户信息。因此,本研究能够利用大数据分析对客户特征提供深刻的理解,并提供有效的客户关系管理系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信