摘要
针对Apriori时间性能较低的缺陷,结合二项集支持度矩阵提出了Apriori改进算法Apriori-M。在扫描数据库时生成一个二项集支持度矩阵,利用矩阵的性质提高了连接和剪枝的效率;通过第二次扫描数据库就能正确地获取所有的频繁项集,并很好地解决了Apriori生成无效二项集的问题。实验结果表明Apriori-M的性能优于Apriori。
An improved algorithm Apriori-M which combines with 2-itemsets support count matrix is brought forward for its lower efficiency of time.The algorithm scans the database to generate 2-itemsets support count matrix,and then improves the efficiency of the connectivity and the pruning by the character of the matrix;gets all the frequent itemsets correctly by scanning the database second time,and also solves the question about generating 2-itemsets invalid.Experimental results show that the capability of the improved algorithm is more efficient than Apriori.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第3期139-141,共3页
Computer Engineering and Applications
基金
山东省自然科学基金No.Y2007G16
山东省科技攻关计划No.2008GG10001015
山东省高新技术自主创新工程专项计划(No.2007ZZ17)
山东省电子发展基金(No.2008B0026)~~
