关键词: 数据挖掘 最大频繁项目集 位串数组

Abstract:

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 b based on a data structure called bit string array, MMFI directly gets maximum frequent itemsets through the bit string and operation.

Key words: data mining, maximum frequent itemsets, bit string array