基于RSA模型和改进K-means算法的电商行业客户细分

CUSTOMER SEGMENTATION OF E-COMMERCE INDUSTRY BASED ON RSA MODEL AND IMPROVED K-MEANS ALGORITHM

  • 摘要: 针对新兴的网络购物客户数量大、客户流动性强和消费数据多的特点,提出RSA模型结合改进的K-means聚类算法实现客户细分。采用熵值法计算RSA模型各指标的权重,综合各个属性计算客户价值。结合K近邻算法和密度峰值算法,提出一种基于K近邻和密度峰值聚类的K-means初始聚类中心选取方法,优化传统K-means算法实现客户细分。通过选取的标准数据集和某零售公司在线交易的真实数据进行实验验证,证明了RSA模型和改进K-means算法具有更加优异的性能。

     

    Abstract: Aimed at the characteristics of the emerging online shopping customers, such as large number of customers, strong customer mobility and large consumption data, the RSA model combined with the improved K-means clustering algorithm is proposed to achieve customer segmentation. The entropy method was used to calculate the weight of each index of the RSA model, and the customer value was calculated by integrating each attribute. Combined with K-nearest neighbor algorithm and density peak algorithm, a K-means initial cluster center selection method based on K-nearest neighbor and density peak clustering was proposed, and the traditional K-means algorithm was optimized to achieve customer segmentation. The selected standard data set and the real data of a retail company’sonline transaction were verified by experiments. It is proved that the RSA model and the improved K-means algorithm have more excellent performance.

     

/

返回文章
返回