【摘要】 在基于位串数组的数据挖掘算法的基础上,进一步提出了一种快速的基于位串数组的最大频繁项目集挖掘算法(BSA MFIA)。通过两次扫描事务数据库D,生成完全由“0”、“1”构成的位串数组。它非常适合于压缩编码存储,可以有效得减少存储空间。然后在位串数组的基础上,通过简单的位运算,产生最大频繁项目集,实验结果表明此方法是快速有效的。更多还原

【Abstract】 Based on the association rule mining algorithm with bit string array,a fast algorithm for mining maximum frequent itemsets with bit string array(BSA-MFIA) is proposed.It scans transaction database D twice and creates the bit string array constructed by “0” and “1”.The bit string array is very suitable for compressing,coding and storing.It may save the storage of the memory efficiently.Then,the maximum frequent itemsets can be mined by using the simple bit operations.As a result,the algorithm not only facilitates the implementation,but also improves the mining efficiency.更多还原