摘要： 针对传统关联规则频繁项集生成效率较低的问题，提出一种改进的基于向量法的数据关联规则挖掘算法。该算法只需扫描一次事务数据库即可完成布尔矩阵的转换，通过向量运算完成频繁项集的查找，减少候选频繁项集的生成。在冠心病中医诊断中的应用结果表明，该算法可有效提取冠心病中医辨证规则。

关键词: 布尔矩阵, 向量运算, 关联规则, 频繁项集

Abstract: Aiming at the problem that the common algorithm often suffers high-complex computation problem, this paper presents an improved association rule algorithm based on vector method, which can map the database into a Boolean matrix by scanning the database only one time. Meanwhile, the frequent itemset can be generated by using simple vector operation. As a result, the number of the frequent items generated by using proposed approach decreases sharply. Experimental results on coronary heart disease data set, including comparisons with the common Apriori approach, illustrate the effectiveness of the proposed algorithm.

Key words: Boolean matrix, vector operation, association rule, frequent itemset

中图分类号: 

• TP18