吉林大学学报(理学版) ›› 2021, Vol. 59 ›› Issue (5): 1245-1251.

• • 上一篇    下一篇

基于密度信息熵的K-means算法在客户细分中的应用

蒲晓川1,2, 黄俊丽2,3, 祁宁2,4, 宋长松2   

  1. 1. 遵义师范学院 信息工程学院, 贵州 遵义 563006; 2. 国立釜庆大学 技术管理学院, 韩国 釜山  48513;
    3. 遵义师范学院 管理学院, 贵州 遵义 563006; 4. 河西学院 经济管理学院, 甘肃 张掖 734000
  • 收稿日期:2020-07-02 出版日期:2021-09-26 发布日期:2021-09-26
  • 通讯作者: 蒲晓川 E-mail:puxiaochuan78906@yeah.net

Application of K-Means Algorithm Based on Density Information Entropy in Customer Segmentation

PU Xiaochuan1,2, HUANG Junli2,3, QI Ning2,4, SONG Changsong2   

  1. 1. School of Information Engineering, Zunyi Normal University, Zunyi 563006, Guizhou Province, China;
    2. Graduate School of Management of Technology, Pukyong National University, Busan 48513, South Korea;
    3. School of Management, Zunyi Normal University, Zunyi 563006, Guizhou Province, China;
    4. School of Economics and Management, Hexi University, Zhangye 734000, Gansu Province, China
  • Received:2020-07-02 Online:2021-09-26 Published:2021-09-26

摘要: 为解决企业客户价值体现问题, 提出一种TFA客户细分改进模型, 以客户发展空间T、 购买频次F和平均购买额A为指标, 充分体现客户的价值和发展空间. 首先, 引入局部密度值ρ和信息熵H, 改进K-means聚类算法, 以优化传统K-means聚类方法初始聚类中心的选取问题;其次, 通过搭建机器学习框架, 对选取人工数据集及真实数据集进行聚类实验, 验证模型的有效性. 实验结果表明, 该模型能有效分类客户, 充分反映客户价值及其发展空间, 并通过改进聚类算法提升了算法效率.

关键词: 客户分类, 客户发展空间, K-means算法, 初始聚类中心, 密度信息熵

Abstract: In order to solve the problem of the reflection of corporate customer value, we proposed an improved model of TFA customer segmentation, which took customer development space T, purchase frequency F, and average purchase amount A as indicators to fully reflect the customer value and development space. Firstly, the K-means clustering algorithm was improved by introducing local density value ρ and information entropy H to optimize the traditional K-means clustering method in the initial clustering center selection problem. Secondly, by building a machine learning framework, clustering experiments were carried out on selected artificial data sets and real data sets to verify the effectiveness of the model. The experimental results show that the model can more effectively classify customers, fully reflect the customer value and its development space, and improve the efficiency of the algorithm by improving the clustering algorithm.

Key words: customer classification, customer development space, K-means algorithm, initial clustering center, density information entropy

中图分类号: 

  • TP391