摘要
介绍Apriori算法的原理和基础,并对制约Apriori算法效率的瓶颈问题提出一种改进策略,针对该算法的两个缺陷,多次扫描事务数据库并产生大量的候选集,提出一种0-1矩阵的改进算法改变由低维频繁项目集到高维频繁项目集的多次连接运算。此改进算法大大减少了访问数据库的次数,提高系统的运行效率,同时还减少大量的候选集的产生,节约存储空间。
Introduces the principle and performance of Apriori algorithm and designs a new Apriori algorithm to solve the restrict of the efficiency of the Apriori algorithm.According to the two defects of Apriori algorithm： scanning database too much and creating excessive candidate itemsets,designs the 0-1 Matrix Algorithm for finding out the highest dimension frequent itemsets.This can improve the algorithm and reduce the times of accessing the database and large numbers of candidate items production and save the storage area at the same time.
出处
《现代计算机》
2011年第6期6-8,16,共4页
Modern Computer
