摘要
Apriori及其改进算法可以归为基于SQL和基于内存两类,为提高关联规则挖掘效率,在分析了一部分第二类算法存在效率瓶颈的基础上,提出了一种高效的改进算法。算法引入两个矩阵,一个矩阵用以映射数据库,另一个用作存储频繁2-项集相关信息,通过对两个矩阵的操作,使得算法时间复杂度明显降低。验证明,算法具有较好的性能。
Apriori and its improved algorithms can be generally classified into two kinds：SQL-based and on memory-based.In order to improve association rule mining efficiency,after analyzing the efficiency bottlenecks in some algorithms of the second class,an improved efficient algorithm is proposed.Two matrixes are introduced into the algorithm：one is used to map database and the other to store frequent 2-itemsets related information.Through the operation of two matrixes,its time complexity and space complexity decrease significantly.The experiment indicates that the method has better performance.
出处
《电子科技》
2012年第5期126-128,136,共4页
Electronic Science and Technology
关键词
数据挖掘
事务矩阵
支持矩阵
向量内积
裁剪
data mining
transaction matrix
support matrix
inner product
prune
