Skip to Main Content
In this paper, we revisit the frequent itemsets mining algorithm F-Miner which is an efficient algorithm on both sparse and dense databases. This paper focuses on how to reduce the time consumption of the outputting stage. This paper proposes two efficient output optimization strategies, output an item as string and compress the frequent itemset. Using these two strategies, we can improve the performance of the algorithm further. Experimental results show that the two output optimization strategies are efficient on both sparse and dense databases.