Abstract: Most mining algorithms of frequent Itemsets are based on Apriori. However, these algorithms make huge candidate itemsets and scan large database again and again. In order to solve this problem, an efficient algorithm called Max-FCIA based on FC-tree for m

Key words: Frequent itemsets, Frequent closed itemsets, Minimum frequent closed itemsets, Maximal frequent closed itemsets, FC-tree （Frequent Pattern Tree ）