
Customer segmentation application based on K-Means
- 1 Southwestern University of Finance and Economics
* Author to whom correspondence should be addressed.
Abstract
Customer segmentation(CS) is a crucial aspect of customer relationship management, widely utilized by industries, banks, and consulting companies. However, the intricate data relationship between individuals presents significant challenges in customer segmentation research. Fortunately, machine learning has made remarkable progress in processing big data, and its exceptional performance has captivated the attention of business analytics researchers. Based on this, numerous customer segmentation methods based on machine learning have been proposed. This paper aims to review the papers published after 2010 on customer segmentation, and summarize the current status and importance of customer segmentation in implementing marketing strategies. Additionally, it introduces two primary types of customer segmentation scenarios, and summarizes the common combination of analysis models and machine learning algorithms in customer segmentation. Finally, the paper introduces a customer segmentation method based on k-means and provides a perspective on the future development of customer segmentation.
Keywords
RFM Analysis, Customer segmentation, K-Means Clustering
[1]. Hiziroglu A. Soft computing applications in customer segmentation: State-of-art review and critique[J]. Expert Systems with Applications, 2013, 40(16): 6491-6507.
[2]. Das S, Nayak J. Customer segmentation via data mining techniques: state-of-the-art review[J]. Computational Intelligence in Data Mining: Proceedings of ICCIDM 2021, 2022: 489-507.
[3]. Ernawati E, Baharin S S K, Kasmin F. A review of data mining methods in RFM-based customer segmentation[C]//Journal of Physics: Conference Series. IOP Publishing, 2021, 1869(1): 012085.
[4]. Peker S, Kart Ö. Transactional data-based customer segmentation applying CRISP-DM methodology: A systematic review[J]. Journal of Data, Information and Management, 2023: 1-21.
[5]. Wei J T, Lin S Y, Wu H H. A review of the application of RFM model[J]. African Journal of Business Management, 2010, 4(19): 4199.
[6]. Patel V R, Mehta R G. Modified k-means clustering algorithm[C]//International Conference on Computational Intelligence and Information Technology. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011: 307-312.
[7]. Yuliari N P P, Putra I K G D, Rusjayanti N K D. Customer segmentation through fuzzy C-means and fuzzy RFM method[J]. Journal of Theoretical and Applied Information Technology, 2015, 78(3): 380.
[8]. Wu J, Shi L, Lin W P, et al. An empirical study on customer segmentation by purchase behaviors using a RFM model and K-means algorithm[J]. Mathematical Problems in Engineering, 2020, 2020: 1-7.
[9]. Chen X, Fang Y, Yang M, et al. Purtreeclust: A clustering algorithm for customer segmentation from massive customer transaction data[J]. IEEE Transactions on Knowledge and Data Engineering, 2017, 30(3): 559-572.
[10]. Sun Z H, Zuo T Y, Liang D, et al. GPHC: A heuristic clustering method to customer segmentation[J]. Applied Soft Computing, 2021, 111: 107677.
Cite this article
Zhao,J. (2024). Customer segmentation application based on K-Means. Applied and Computational Engineering,47,242-247.
Data availability
The datasets used and/or analyzed during the current study will be available from the authors upon reasonable request.
Disclaimer/Publisher's Note
The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of EWA Publishing and/or the editor(s). EWA Publishing and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
About volume
Volume title: Proceedings of the 4th International Conference on Signal Processing and Machine Learning
© 2024 by the author(s). Licensee EWA Publishing, Oxford, UK. This article is an open access article distributed under the terms and
conditions of the Creative Commons Attribution (CC BY) license. Authors who
publish this series agree to the following terms:
1. Authors retain copyright and grant the series right of first publication with the work simultaneously licensed under a Creative Commons
Attribution License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this
series.
2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the series's published
version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial
publication in this series.
3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and
during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See
Open access policy for details).