Mining frequent closed itemsets with the frequent pattern list
Fan‐Chen Tseng, Ching‐Chi Hsu, Hsin‐Hsi Chen · 2002
The mining of a complete set of frequent itemsets will lead to a huge number of itemsets. Fortunately, this problem can be reduced to the mining of frequent closed itemsets (FCIs), which results in a much smaller number of itemsets. The approaches to mining frequent closed itemsets can be categorized into two groups: those with candidate generation and those without. In this paper, we propose an approach to mining frequent closed itemsets without candidate generation with a data structure called the frequent pattern list (FPL). We designed the algorithm FPLCI-mining to mine the FCIs. Experimental results show that our method is faster than previous ones.