Open Access


Download data is not yet available.


Customer segmentation is the process of grouping customers based on similar characteristics such as behavior, shopping habits…so that businesses can do marketing to each customer group effectively and appropriately. Customer segmentation helps businesses determine different strategies and different marketing approaches to different groups. Customer segmentation helps marketers better understand customers as well as provide goals, strategies and marketing methods for different target groups. This paper aims to examine the customer segmentation using clustering method in statistics and unsupervised machine learning. The algorithms used are K-means and Elbow which are famous algorithms that have been successfully applied in many areas such as marketing, biology, library, insurance, finance... The purpose of clustering is to find meaningful market segments. However, the adoption and adjustment of parameters in the algorithms so as to find significant customer segmentations remain a challenge at present. In this paper, we used data of customers of Thu Duc CoopExtra and found significant customer segmentations which can be useful for more effective marketing and customer care by the supermarket.


Author's Affiliation
Article Details

Issue: Vol 3 No 1 (2019)
Page No.: 28-36
Published: May 20, 2019
Section: Research article

 Copyright Info

Creative Commons License

Copyright: The Authors. This is an open access article distributed under the terms of the Creative Commons Attribution License CC-BY 4.0., which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

 How to Cite
Hong Dien, L., Phuc Son, N., Hoang Uyen, P., & Van Hinh, L. (2019). On a segmentation of Coopextra customers in Thu Duc district. VNUHCM Journal of Economics, Business and Law, 3(1), 28-36.

 Cited by

Article level Metrics by Paperbuzz/Impactstory
Article level Metrics by Altmetrics

 Article Statistics
HTML = 626 times
Download PDF   = 1993 times
Total   = 1993 times