基于位串数组的最大频繁项目集挖掘算法

A Bit String Array-Based Mining Algorithm for Maximum Frequent Itemset

关联规则挖掘的主要性能由发现频繁项目集决定。频繁项目集是最大频繁项目集的子集,因而找到所有最大频繁项目集是问题的关键。本文使用位串数组的数据结构提出了一种挖掘最大频繁项目集的算法MMFI。该算法通过位串与操作直接得到最大频繁项目集。

The performance of association rule mining is decided by discovering frequent itemsets, and the frequent itemset is the subset of the maximum frequent itemset, so the key is to find all the maximum frequent itemsets. A new algorithm for mining maximum frequent itemsets （MMFI） is proposed, which is based on a data structure called bit string array, MMFI directly gets maximum frequent itemsets through the bit string and operation.