摘要
Apriori算法是关联规则挖掘中的经典算法。本文针对Apriori算法的瓶颈提出一种使用先验算法产生频繁2项目集。并给出了一种简单有效的逐步缩减交易数据库的方法,加快了频繁k项目集的验证速度。新算法减小了存储空间,并显著提高了Apriori算法的效率,并改进了数据挖掘算法的性能。
Apriofi algorithm is a classical algorithm of association rule mining. To solve the bottleneck of the apriori algorithm, a new method to generate the 2-frequent item sets is put forward. To accelerate the verification speed of the k-frequent item sets, a simple and highly efficient method of minimizing the trade database is given. The result shows that the new algorithm promotes the algorithm efficiency and at the same time improves the performance of the data mining technique through cutting down the store space.
出处
《微计算机信息》
北大核心
2006年第03X期193-194,共2页
Control & Automation
