客户关系管理中基于约束的关联规则挖掘方法研究  

Constraint-based Association Rule Mining in CRM

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

机构地区：[1]中国科学院沈阳自动化研究所,辽宁沈阳110016

出　　处：《计算机集成制造系统-CIMS》2004年第4期465-470,共6页

基　　金：国家863/CIMS主题资助项目(2001AA414210)。~~

摘　　要：分析功能的深化是客户关系管理的一大发展趋势,交叉销售分析是客户关系管理中主要分析的内容之一。针对企业需求,分析和描述了交叉销售中的两类问题,根据其特点提出了一种前件固定、后件受约束的关联规则快速挖掘算法,以及一种后件固定、前件受约束的关联规则快速挖掘算法。The deepening of analytic function is one of the significant trends of CRM and the analysis of cross-selling is one of the important parts in CRM-analyzing. According to the enterprises' needs, two kinds of problems are described and analyzed, which exist in cross-selling. And then two algorithms of mining constraint-based association rules are presented according to the characteristics of these two problems. In the first algorithm, the rule's antecedent is specified and it's consequent is constrained, and in the second algorithm, the rule's consequent is specified and its antecedent is constrained. It is shown in the results of the numerical simulation that the outcome of the mining can support cross-selling effectively.

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

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]