摘要
关联是数据挖掘领域的一个重要研究课题。对关联规则挖掘进行了介绍,对Apriori算法进行了分析,针对该算法的不足,并结合CRM实际应用中的RFM(Recency,Frequency,Monetary)要求,提出了基于RFM约束和事务压缩的改进型算法———Apriori_RFM。实验表明,改进的算法减小了访问数据库的规模,提高了查准率和关联质量。
Association is a very important topic in the field of data mining.In this paper,the algorithms is introduced for mining association rules,the Apriori algorithm is analyzed.The paper gives an improved algorithm Aprlori_RFM according to the defects of Apriori algorithm and to meet the requirements of CRM applications for RFM （Recentcy, Frenquency,Monetary）.The experiments show that the improved algorithm reduces the scales for accessing databases, improves precision and association quality.
出处
《计算机工程与应用》
CSCD
北大核心
2005年第26期184-187,共4页
Computer Engineering and Applications
