Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (4): 12-14.DOI: 10.3778/j.issn.1002-8331.2010.04.004

• 博士论坛 • Previous Articles     Next Articles

Effective algorithm to cluster customers’ actions

LIU Hui-ting1,NI Zhi-wei2   

  1. 1.School of Computer Science and Technology,Anhui University,Hefei 230039,China
    2.Institute of Computer Network System,Hefei University of Technology,Hefei 230009,China
  • Received:2009-10-12 Revised:2009-11-27 Online:2010-02-01 Published:2010-02-01
  • Contact: LIU Hui-ting

客户行为的有效聚类

刘慧婷1,倪志伟2   

  1. 1.安徽大学 计算机科学与技术学院,合肥 230039
    2.合肥工业大学 计算机网络所,合肥 230009
  • 通讯作者: 刘慧婷

Abstract: Clustering customers’ transaction data is an important analysis means of customers’ behavior.As customers’ transaction data have high dimension,the clustering algorithm based on Empirical Mode Decomposition(EMD) and K-means is implemented to cluster the customers’ actions in supermarkets,that is,employ the EMD and bottom-up algorithms to realize dimension reduction,and further use K-means algorithm to support effective clustering on data sequences,which have fewer dimensions. Customers are divided into different categories(or sub-market) by means of clustering customers’ transaction data.Each sub-market is then described by the commodities which are purchased with higher rates,so as to make respective promotions and advertisements.The clustering algorithm proposed in this paper can effectively cluster customers’ behavior,and as the algorithm has dealt with dimensionality reduction to a sequence of transaction data,this can save a certain amount of storage space.

摘要: 对客户的交易数据进行聚类是客户行为分析的一个重要手段。针对客户交易数据维数高的特点,提出了基于EMD和K-means的顾客行为聚类算法。首先利用EMD和自底向上分段算法实现交易数据序列维度的约简,再利用K-means算法完成降维后序列的聚类,最后利用每个类别中购买率较高的商品作为该类的描述,为商家提供促销依据。该聚类算法一方面可以有效实现客户行为的聚类,另一方面,由于算法对交易数据序列进行了降维处理,节约了一定的存储空间。

CLC Number: