In:
The Computer Journal, Oxford University Press (OUP), Vol. 66, No. 4 ( 2023-04-15), p. 941-962
Abstract:
In a competitive market, it is of great significance to divide customer groups to develop customer-centered personalized products. In this paper, we propose a customer segmentation method based on the K-means algorithm and the improved particle swarm optimization (PSO) algorithm. As the PSO algorithm easily falls into local extremum, the improved hybrid particle swarm optimization (IHPSO) algorithm is proposed to improve optimization accuracy. The full factorial design is used to determine the optimal parameter combination; the roulette operator is used to select excellent particles; then, the selected particles are crossed according to their adaptive crossover probabilities; when the population falls into a local optimum, the particles are mutated according to their adaptive mutation probabilities. Aimed at the K-means’ sensitivity to selecting the initial cluster centers, IHPSO is used to optimize the cluster centers (IHPSO-KM). We compare IHPSO with the PSO, LDWPSO, GA, GA-PSO and ALPSO algorithms on nine benchmark functions. We also conduct comparative experiments to compare IHPSO-KM with several conventional and state-of-the-art approaches on five UCI datasets. All results show that the two proposed methods outperform existing models. Finally, IHPSO-KM is applied in customer segmentation. The experimental results also prove the rationality and applicability of IHPSO-KM for customer segmentation.
Type of Medium:
Online Resource
ISSN:
0010-4620
,
1460-2067
DOI:
10.1093/comjnl/bxab206
Language:
English
Publisher:
Oxford University Press (OUP)
Publication Date:
2023
detail.hit.zdb_id:
1477172-X
