中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Fast Association Rule Mining in CRM

文献类型:期刊论文

作者Wang FD(王扶东); Li J(李洁); Xue JS(薛劲松); Zhu YL(朱云龙)
刊名中国科学院研究生院学报
出版日期2004
卷号21期号:3页码:358-365
ISSN号1002-1175
关键词数据挖掘 关联规则 客户关系管理
其他题名关联规则快速挖掘在CRM中的应用
产权排序1
英文摘要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.
语种英语
CSCD记录号CSCD:1858146
资助机构supportedbyNationalHigh techR&DPlan( 863 CIMS 2 0 0 1AA414 2 10 ;;2 0 0 3AA413 0 2 1)andNNSF ( 70 1710 43 )
公开日期2010-11-29
源URL[http://210.72.131.170//handle/173321/4381]  
专题沈阳自动化研究所_工业信息学研究室_先进制造技术研究室
通讯作者Wang FD(王扶东)
作者单位1.Shenyang Institute of Automation, Chinese Academy of Sciences
2.Shenyang Institute of Technology
推荐引用方式
GB/T 7714
Wang FD,Li J,Xue JS,et al. Fast Association Rule Mining in CRM[J]. 中国科学院研究生院学报,2004,21(3):358-365.
APA Wang FD,Li J,Xue JS,&Zhu YL.(2004).Fast Association Rule Mining in CRM.中国科学院研究生院学报,21(3),358-365.
MLA Wang FD,et al."Fast Association Rule Mining in CRM".中国科学院研究生院学报 21.3(2004):358-365.

入库方式: OAI收割

来源:沈阳自动化研究所

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。