电子科技2012，Vol.25Issue(5)：126-128,136,4.
改进的基于两个矩阵的关联规则挖掘算法
Improved Association Rule Mining Algorithm Based on Two Matrixes
曹风华1
作者信息
- 1. 内蒙古财经学院计算机信息管理学院,内蒙古呼和浩特010070
- 折叠
摘要
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分类
信息技术与安全科学引用本文复制引用
曹风华..改进的基于两个矩阵的关联规则挖掘算法[J].电子科技,2012,25(5):126-128,136,4.
