Genetic based density peak possibilistic fuzzy c-means algorithms to cluster analysis- a case study on customer segmentation

被引:4
作者
Kuo, R. J. [1 ]
Alfareza, Muhammad Naufal [1 ]
Nguyen, Thi Phuong Quyen [2 ]
机构
[1] Natl Taiwan Univ Sci & Technol, Dept Ind Management, 43,Sect 4,Kee Lung Rd, Taipei 106, Taiwan
[2] Univ Danang, Univ Sci & Technol, Fac Project Management, 54 Nguyen Luong Bang, Danang, Vietnam
来源
ENGINEERING SCIENCE AND TECHNOLOGY-AN INTERNATIONAL JOURNAL-JESTECH | 2023年 / 47卷
关键词
Customer segmentation; Density peak clustering; Genetic algorithm; Possibilistic fuzzy c-means algorithm; MARKET-SEGMENTATION;
D O I
10.1016/j.jestch.2023.101525
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Finding the target consumers for a business depends heavily on its market segmentation approach. Applying clustering analysis to consumer segmentation is one of the most common methods. However, most clustering algorithms can easily fall into the local optimum solution. Besides, it can be challenging to handle noise and outliers and determine the optimal parameters. The initial cluster centers can also affect the clustering result. Thus, this study proposes a clustering algorithm that first employs density peak clustering to obtain the initial cluster centers. Then, the proposed method integrates genetic algorithm (GA) with possibilistic fuzzy c-means (PFCM) algorithm, where GA is used to optimize the cluster centers and the parameters of the PFCM algorithm to overcome the problems above. Using eleven benchmark datasets, the computational results demonstrate that the proposed algorithm can provide better and more robust results in terms of accuracy, adjusted rand index (ARI), and normalized mutual information (NMI) compared to previous clustering algorithms. Additionally, the proposed algorithm is used to segment customers of a retail company in a dataset containing recency, frequency, and monetary (RFM) variables. The clustering result for customer segmentation is also very promising.
引用
收藏
页数:13
相关论文
共 30 条
[21]   Improving a Centroid-Based Clustering by Using Suitable Centroids from Another Clustering [J].
Rezaei, Mohammad .
JOURNAL OF CLASSIFICATION, 2020, 37 (02) :352-365
[22]   Variable-Size Cooperative Coevolutionary Particle Swarm Optimization for Feature Selection on High-Dimensional Data [J].
Song, Xian-Fang ;
Zhang, Yong ;
Guo, Yi-Nan ;
Sun, Xiao-Yan ;
Wang, Yong-Li .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (05) :882-895
[23]   Discrete Sine-Cosine Algorithm (DSCA) with Local Search for Solving Traveling Salesman Problem [J].
Tawhid, Mohamed A. ;
Savsani, Poonam .
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2019, 44 (04) :3669-3679
[24]   A density-peak-based clustering algorithm of automatically determining the number of clusters [J].
Tong, Wuning ;
Liu, Sen ;
Gao, Xiao-Zhi .
NEUROCOMPUTING, 2021, 458 :655-666
[25]   VDPC: Variational density peak clustering algorithm [J].
Wang, Yizhang ;
Wang, Di ;
Zhou, You ;
Zhang, Xiaofeng ;
Quek, Chai .
INFORMATION SCIENCES, 2023, 621 :627-651
[26]   Self-Adaptive Particle Swarm Optimization for Large-Scale Feature Selection in Classification [J].
Xue, Yu ;
Xue, Bing ;
Zhang, Mengjie .
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA, 2019, 13 (05)
[27]  
Zeebaree D.Q, 2017, Int. J. Appl. Eng. Res., V12, P14238
[28]   Market segmentation approach to investigate existing and potential aviation markets [J].
Zhou, Heng ;
Norman, Richard ;
Kelobonye, Keone ;
Xia, Jianhong ;
Hughes, Brett ;
Nikolova, Gabi ;
Falkmer, Torbjorn .
TRANSPORT POLICY, 2020, 99 :120-135
[29]   Market segmentation using high-dimensional sparse consumers data [J].
Zhou, Jian ;
Zhai, Linli ;
Pantelous, Athanasios A. .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 145
[30]   Safety detection algorithm in sensor network based on ant colony optimization with improved multiple clustering algorithms [J].
Zhu, Limin .
SAFETY SCIENCE, 2019, 118 :96-102