关键词: 数据挖掘, 事务矩阵, 支持矩阵, 向量内积, 裁剪

Abstract:

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.

Key words: data mining;transaction matrix;support matrix;inner product;prune