关联规则快速挖掘在CRM中的应用(英文)  

Fast Association Rule Mining in CRM

作　　者：王扶东[1] 李洁[2] 薛劲松[1] 朱云龙[1] 

机构地区：[1]中国科学院沈阳自动化研究所,沈阳110016 [2]沈阳理工大学,沈阳110168

出　　处：《中国科学院研究生院学报》2004年第3期358-365,共8页Journal of the Graduate School of the Chinese Academy of Sciences

基　　金：supportedbyNationalHigh techR&DPlan( 863 CIMS 2 0 0 1AA414 2 10 ;2 0 0 3AA413 0 2 1)andNNSF ( 70 1710 43 )

摘　　要：交叉销售分析是CRM中的主要分析内容之一 .提出了一种前件固定、后件受约束的关联规则快速挖掘算法 ,该算法的挖掘结果可以帮助企业利用销售情况好的产品促进其他产品的销售 ;同时提出了一种后件固定、前件受约束的关联规则快速挖掘算法 ,该算法的挖掘结果可以有效地帮助企业利用交叉销售方法为新产品开拓市场 .仿真结果表明 。The analysis of cross selling is one of the important parts in analytical CRM. We present a constraint based association rules mining algorithm AApriori with the specified antecedent and the constrained consequent. The outcome of this algorithm can help enterprises use selling products to popularize products that are unpopular. At the same time, an algorithm CApriori that the consequent is specified and the antecedent is constraind is presented. It can effectively support enterprises to exploit the market of new products. The evaluation demonstrated that the algorithm AApriori and CApriori could quickly get exact information that the enterprise wants.

关 键 词：数据挖掘 关联规则 客户关系管理 

分 类 号：O231[理学—运筹学与控制论]