摘要
针对类Apriori关联规则挖掘算法的不足,将以往关联规则算法予改进,提出一个更有效率的关联规则挖掘算法EARM算法。通过试验评估,该文所提算法的挖掘效率比Apriori及其改良算法要快2到5倍。
This paper discusses the disadvantages of the algorithm for mining of association rules based on Apriori, presents a more efficient algorithm for mining of association rules. The experiment evaluation shows that the algorithm is faster than Apriori and its extends algorithm by a factor from two to five by experiments evaluation.
出处
《计算机应用》
CSCD
北大核心
2003年第7期46-48,共3页
journal of Computer Applications
基金
云南省信息技术基金资助 (2 0 0 2IT0 3 )
关键词
数据挖掘
关联规则
data mining
association rule
