A new algorithm for mining maximal frequent itemsets
一种新的最大频繁项目集挖掘算法

Maximal frequent itemsets mining was one of the most important basic problems for itemset mining. Based on the analysis of the existing algorithms, a new algorithm for maximal frequent itemsets mining was presented. Comparative experiments show that the new algorithm outperforms the current algorithms such as MAximal Frequent Itemset Algorithm for transactional database (MAFIA).