A Combination Approach to Frequent Itemsets Mining

In this paper, we propose a new mining of frequent itemsets algorithm, called SFI-mine algorithm. The SFI-mine constructs pattern-base by using a new method which is different from the conditional pattern-base in FP-growth, mines frequent itemsets with a new combination method without recursive construction of conditional FP-trees. It obtains complete and correct frequent itemsets. We have conducted the examples of all definitions and correctness proving.