Abstract: This paper presents a high efficiency algorithm based on matrix for mining association rules.Compared it with traditional algorithms, ABM only needs scan the database one time,and occupies few memory for assistant information.Experiment results indicate that the new algorithm has good efficiency.

摘要： 提出了一种基于矩阵的挖掘关联规则的高效ABM算法,与经典的挖掘算法相比,该算法只需对数据库扫描一遍,并且存放辅助信息所需要的空间也比较少,实验表明该算法的效率较高。

关键词: 关联规则, 频繁项集, 基于矩阵的算法

CLC Number: 

• TP311