An Efficient Mining Model for Global Frequent Closed Itemsets
In this paper we address the problem of mining frequent closed itemsets in a highly distributed setting. At present, many sequential algorithms have been proposed for mining frequent closed itemsets. However, very little work has been done in discovering frequent closed itemsets in distributed environment. In this paper , an efficient mining model for global frequent closed itemsets is presented, which first analyzes distributed setting from three aspects, and then presented two mining algorithms under corresponding distributed setting. Finally experimental results show the feasibility and effectiveness of the model.