摘要
针对Apriori关联规则算法需要多次扫描事务数据库及产生的候选集庞大的瓶颈问题,提出一种不产生候选项目集,即可产生项目集的新算法,对数据的处理次数大大减少,提高了挖掘效率。并结合在儿童培训机构客户关系管理(CRM)中客户选择的培训内容的具体应用分析,阐明了基于Apriori改进算法的CRM数据挖掘对于儿童培训机构增强竞争优势的重要意义。
Concerning the bottleneck of classical Apriori algorithm which need scan the transaction database multiple times and might produce large candidate item sets, a new Apriori algorithm was proposed. The new algorithm could produce the item sets without producing candidate item sets, thus greatly decreased the dealing times with data and improved the efficiency of data mining. The new algorithm was applied to analyze the chosen training items in the children training institute, expounding the important meaning for increasing the competition of the improved Apriori algorithm in CRM of children training institutes.
出处
《计算机应用》
CSCD
北大核心
2009年第5期1477-1479,共3页
journal of Computer Applications
关键词
数据挖掘
儿童培训机构
客户关系管理
APRIORI算法
频繁集
data mining
children training institute
Customer Relationship Management (CRM)
Apriori algorithm
frequent itemset