Based on Frequent Itemset for Maximal Frequent Itesets

This paper proposes a maximal frequent itemsets mining algorithm BFI-MFI (Based on Frequent Itemset for maximal frequent itemsets). A maximal frequent itemset in frequent itemsets can be confirmed through detecting whether exiting their superset. This algorithm provides a new method, which improve the mining efficiency.