Loading…

User value identification based on an improved consumer value segmentation algorithm

PurposeThe purpose of this study is to propose a new consumer value segmentation method for low-dimensional dense market datasets to quickly detect and cluster the most profitable customers for the enterprises.Design/methodology/approachIn this study, the comprehensive segmentation bases (CSB) with...

Full description

Saved in:
Bibliographic Details
Published in:Kybernetes 2023-11, Vol.52 (10), p.4495-4530
Main Authors: Qi, Jianfang, Li, Yue, Jin, Haibin, Feng, Jianying, Mu, Weisong
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823
cites cdi_FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823
container_end_page 4530
container_issue 10
container_start_page 4495
container_title Kybernetes
container_volume 52
creator Qi, Jianfang
Li, Yue
Jin, Haibin
Feng, Jianying
Mu, Weisong
description PurposeThe purpose of this study is to propose a new consumer value segmentation method for low-dimensional dense market datasets to quickly detect and cluster the most profitable customers for the enterprises.Design/methodology/approachIn this study, the comprehensive segmentation bases (CSB) with richer meanings were obtained by introducing the weighted recency-frequency-monetary (RFM) model into the common segmentation bases (SB). Further, a new market segmentation method, the CSB-MBK algorithm was proposed by integrating the CSB model and the mini-batch k-means (MBK) clustering algorithm.FindingsThe results show that our proposed CSB model can reflect consumers' contributions to a market, as well as improve the clustering performance. Moreover, the proposed CSB-MBK algorithm is demonstrably superior to the SB-MBK, CSB-KMA and CSB-Chameleon algorithms with respect to the Silhouette Coefficient (SC), the Calinski-Harabasz (CH) Index , the average running time and superior to the SB-MBK, RFM-MBK and WRFM-MBK algorithms in terms of the inter-market value and characteristic differentiation.Practical implicationsThis paper provides a tool for decision-makers and marketers to segment a market quickly, which can help them grasp consumers' activity, loyalty, purchasing power and other characteristics in a target market timely and achieve the precision marketing.Originality/valueThis study is the first to introduce the CSB-MBK algorithm for identifying valuable customers through the comprehensive consideration of the clustering quality, consumer value and segmentation speed. Moreover, the CSB-MBK algorithm can be considered for applications in other markets.
doi_str_mv 10.1108/K-01-2022-0049
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1108_K_01_2022_0049</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2884479691</sourcerecordid><originalsourceid>FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823</originalsourceid><addsrcrecordid>eNplkE1LAzEQhoMoWKtXzwueUyfZfB6lqJUWvFjwFrLZtG7Zj5rsFvw3_hZ_mSkrgsgchoH3eWfmReiawIwQULdLDARToBQDMH2CJkRyhaVS-SmaQC4UZpq-nqOLGHcAhAoKE7ReRx-yg60Hn1Wlb_tqUznbV12bFTb6Muvar0_bZlWzD90hza5r49D8MtFvm0SNhK23Xaj6t-YSnW1sHf3VT5-i9cP9y3yBV8-PT_O7FXY58B5T7b0qS64pY1KwgkmuOacgU1nLQDpNCuG1EMBIQRkvqJNOFdx6TbSi-RTdjL7puPfBx97suiG0aaWhSiVTLTRJqtmocqGLMfiN2YeqseHDEDDH6MzSADHH6MwxugTgEfDpUVuX__V_os6_AeMIbso</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2884479691</pqid></control><display><type>article</type><title>User value identification based on an improved consumer value segmentation algorithm</title><source>Emerald:Jisc Collections:Emerald Subject Collections HE and FE 2024-2026:Emerald Premier (reading list)</source><creator>Qi, Jianfang ; Li, Yue ; Jin, Haibin ; Feng, Jianying ; Mu, Weisong</creator><creatorcontrib>Qi, Jianfang ; Li, Yue ; Jin, Haibin ; Feng, Jianying ; Mu, Weisong</creatorcontrib><description>PurposeThe purpose of this study is to propose a new consumer value segmentation method for low-dimensional dense market datasets to quickly detect and cluster the most profitable customers for the enterprises.Design/methodology/approachIn this study, the comprehensive segmentation bases (CSB) with richer meanings were obtained by introducing the weighted recency-frequency-monetary (RFM) model into the common segmentation bases (SB). Further, a new market segmentation method, the CSB-MBK algorithm was proposed by integrating the CSB model and the mini-batch k-means (MBK) clustering algorithm.FindingsThe results show that our proposed CSB model can reflect consumers' contributions to a market, as well as improve the clustering performance. Moreover, the proposed CSB-MBK algorithm is demonstrably superior to the SB-MBK, CSB-KMA and CSB-Chameleon algorithms with respect to the Silhouette Coefficient (SC), the Calinski-Harabasz (CH) Index , the average running time and superior to the SB-MBK, RFM-MBK and WRFM-MBK algorithms in terms of the inter-market value and characteristic differentiation.Practical implicationsThis paper provides a tool for decision-makers and marketers to segment a market quickly, which can help them grasp consumers' activity, loyalty, purchasing power and other characteristics in a target market timely and achieve the precision marketing.Originality/valueThis study is the first to introduce the CSB-MBK algorithm for identifying valuable customers through the comprehensive consideration of the clustering quality, consumer value and segmentation speed. Moreover, the CSB-MBK algorithm can be considered for applications in other markets.</description><identifier>ISSN: 0368-492X</identifier><identifier>EISSN: 1758-7883</identifier><identifier>DOI: 10.1108/K-01-2022-0049</identifier><language>eng</language><publisher>London: Emerald Publishing Limited</publisher><subject>Algorithms ; Behavior ; Big Data ; Cluster analysis ; Clustering ; Consumers ; Customers ; Efficient markets ; Emotions ; Geography ; Market segmentation ; Market value ; Marketing ; Tourism</subject><ispartof>Kybernetes, 2023-11, Vol.52 (10), p.4495-4530</ispartof><rights>Emerald Publishing Limited</rights><rights>Emerald Publishing Limited.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823</citedby><cites>FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823</cites><orcidid>0000-0003-2063-7933 ; 0000-0003-1392-2074</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Qi, Jianfang</creatorcontrib><creatorcontrib>Li, Yue</creatorcontrib><creatorcontrib>Jin, Haibin</creatorcontrib><creatorcontrib>Feng, Jianying</creatorcontrib><creatorcontrib>Mu, Weisong</creatorcontrib><title>User value identification based on an improved consumer value segmentation algorithm</title><title>Kybernetes</title><description>PurposeThe purpose of this study is to propose a new consumer value segmentation method for low-dimensional dense market datasets to quickly detect and cluster the most profitable customers for the enterprises.Design/methodology/approachIn this study, the comprehensive segmentation bases (CSB) with richer meanings were obtained by introducing the weighted recency-frequency-monetary (RFM) model into the common segmentation bases (SB). Further, a new market segmentation method, the CSB-MBK algorithm was proposed by integrating the CSB model and the mini-batch k-means (MBK) clustering algorithm.FindingsThe results show that our proposed CSB model can reflect consumers' contributions to a market, as well as improve the clustering performance. Moreover, the proposed CSB-MBK algorithm is demonstrably superior to the SB-MBK, CSB-KMA and CSB-Chameleon algorithms with respect to the Silhouette Coefficient (SC), the Calinski-Harabasz (CH) Index , the average running time and superior to the SB-MBK, RFM-MBK and WRFM-MBK algorithms in terms of the inter-market value and characteristic differentiation.Practical implicationsThis paper provides a tool for decision-makers and marketers to segment a market quickly, which can help them grasp consumers' activity, loyalty, purchasing power and other characteristics in a target market timely and achieve the precision marketing.Originality/valueThis study is the first to introduce the CSB-MBK algorithm for identifying valuable customers through the comprehensive consideration of the clustering quality, consumer value and segmentation speed. Moreover, the CSB-MBK algorithm can be considered for applications in other markets.</description><subject>Algorithms</subject><subject>Behavior</subject><subject>Big Data</subject><subject>Cluster analysis</subject><subject>Clustering</subject><subject>Consumers</subject><subject>Customers</subject><subject>Efficient markets</subject><subject>Emotions</subject><subject>Geography</subject><subject>Market segmentation</subject><subject>Market value</subject><subject>Marketing</subject><subject>Tourism</subject><issn>0368-492X</issn><issn>1758-7883</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNplkE1LAzEQhoMoWKtXzwueUyfZfB6lqJUWvFjwFrLZtG7Zj5rsFvw3_hZ_mSkrgsgchoH3eWfmReiawIwQULdLDARToBQDMH2CJkRyhaVS-SmaQC4UZpq-nqOLGHcAhAoKE7ReRx-yg60Hn1Wlb_tqUznbV12bFTb6Muvar0_bZlWzD90hza5r49D8MtFvm0SNhK23Xaj6t-YSnW1sHf3VT5-i9cP9y3yBV8-PT_O7FXY58B5T7b0qS64pY1KwgkmuOacgU1nLQDpNCuG1EMBIQRkvqJNOFdx6TbSi-RTdjL7puPfBx97suiG0aaWhSiVTLTRJqtmocqGLMfiN2YeqseHDEDDH6MzSADHH6MwxugTgEfDpUVuX__V_os6_AeMIbso</recordid><startdate>20231101</startdate><enddate>20231101</enddate><creator>Qi, Jianfang</creator><creator>Li, Yue</creator><creator>Jin, Haibin</creator><creator>Feng, Jianying</creator><creator>Mu, Weisong</creator><general>Emerald Publishing Limited</general><general>Emerald Group Publishing Limited</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>7TB</scope><scope>7X5</scope><scope>7XB</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K6~</scope><scope>K7-</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0N</scope><scope>M2O</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>Q9U</scope><orcidid>https://orcid.org/0000-0003-2063-7933</orcidid><orcidid>https://orcid.org/0000-0003-1392-2074</orcidid></search><sort><creationdate>20231101</creationdate><title>User value identification based on an improved consumer value segmentation algorithm</title><author>Qi, Jianfang ; Li, Yue ; Jin, Haibin ; Feng, Jianying ; Mu, Weisong</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Behavior</topic><topic>Big Data</topic><topic>Cluster analysis</topic><topic>Clustering</topic><topic>Consumers</topic><topic>Customers</topic><topic>Efficient markets</topic><topic>Emotions</topic><topic>Geography</topic><topic>Market segmentation</topic><topic>Market value</topic><topic>Marketing</topic><topic>Tourism</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Qi, Jianfang</creatorcontrib><creatorcontrib>Li, Yue</creatorcontrib><creatorcontrib>Jin, Haibin</creatorcontrib><creatorcontrib>Feng, Jianying</creatorcontrib><creatorcontrib>Mu, Weisong</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Mechanical &amp; Transportation Engineering Abstracts</collection><collection>Entrepreneurship Database</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>AUTh Library subscriptions: ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><collection>Computing Database</collection><collection>ProQuest research library</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>ProQuest Central Basic</collection><jtitle>Kybernetes</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Qi, Jianfang</au><au>Li, Yue</au><au>Jin, Haibin</au><au>Feng, Jianying</au><au>Mu, Weisong</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>User value identification based on an improved consumer value segmentation algorithm</atitle><jtitle>Kybernetes</jtitle><date>2023-11-01</date><risdate>2023</risdate><volume>52</volume><issue>10</issue><spage>4495</spage><epage>4530</epage><pages>4495-4530</pages><issn>0368-492X</issn><eissn>1758-7883</eissn><abstract>PurposeThe purpose of this study is to propose a new consumer value segmentation method for low-dimensional dense market datasets to quickly detect and cluster the most profitable customers for the enterprises.Design/methodology/approachIn this study, the comprehensive segmentation bases (CSB) with richer meanings were obtained by introducing the weighted recency-frequency-monetary (RFM) model into the common segmentation bases (SB). Further, a new market segmentation method, the CSB-MBK algorithm was proposed by integrating the CSB model and the mini-batch k-means (MBK) clustering algorithm.FindingsThe results show that our proposed CSB model can reflect consumers' contributions to a market, as well as improve the clustering performance. Moreover, the proposed CSB-MBK algorithm is demonstrably superior to the SB-MBK, CSB-KMA and CSB-Chameleon algorithms with respect to the Silhouette Coefficient (SC), the Calinski-Harabasz (CH) Index , the average running time and superior to the SB-MBK, RFM-MBK and WRFM-MBK algorithms in terms of the inter-market value and characteristic differentiation.Practical implicationsThis paper provides a tool for decision-makers and marketers to segment a market quickly, which can help them grasp consumers' activity, loyalty, purchasing power and other characteristics in a target market timely and achieve the precision marketing.Originality/valueThis study is the first to introduce the CSB-MBK algorithm for identifying valuable customers through the comprehensive consideration of the clustering quality, consumer value and segmentation speed. Moreover, the CSB-MBK algorithm can be considered for applications in other markets.</abstract><cop>London</cop><pub>Emerald Publishing Limited</pub><doi>10.1108/K-01-2022-0049</doi><tpages>36</tpages><orcidid>https://orcid.org/0000-0003-2063-7933</orcidid><orcidid>https://orcid.org/0000-0003-1392-2074</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0368-492X
ispartof Kybernetes, 2023-11, Vol.52 (10), p.4495-4530
issn 0368-492X
1758-7883
language eng
recordid cdi_crossref_primary_10_1108_K_01_2022_0049
source Emerald:Jisc Collections:Emerald Subject Collections HE and FE 2024-2026:Emerald Premier (reading list)
subjects Algorithms
Behavior
Big Data
Cluster analysis
Clustering
Consumers
Customers
Efficient markets
Emotions
Geography
Market segmentation
Market value
Marketing
Tourism
title User value identification based on an improved consumer value segmentation algorithm
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T10%3A00%3A39IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=User%20value%20identification%20based%20on%C2%A0an%20improved%20consumer%20value%20segmentation%20algorithm&rft.jtitle=Kybernetes&rft.au=Qi,%20Jianfang&rft.date=2023-11-01&rft.volume=52&rft.issue=10&rft.spage=4495&rft.epage=4530&rft.pages=4495-4530&rft.issn=0368-492X&rft.eissn=1758-7883&rft_id=info:doi/10.1108/K-01-2022-0049&rft_dat=%3Cproquest_cross%3E2884479691%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c305t-29ee8dd59244764b475955207070aa407c91b6e966041b245b2c7c8b5ae919823%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2884479691&rft_id=info:pmid/&rfr_iscdi=true