Journal of Jilin University Science Edition ›› 2021, Vol. 59 ›› Issue (5): 1245-1251.

Previous Articles     Next Articles

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

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

CLC Number: 

  • TP391