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.
frequent closed itemsets distributed environment global
Jianming Lin Chunhua Ju Dongsheng Liu
ZheJiang GongShang University, Hangzhou, ZheJiang, 310018 , China Information Center of Zhejiang Pro ZheJiang GongShang University, Hangzhou, ZheJiang, 310018, China
国际会议
Second International Symposium on Electronic Commerce and Security(第二届电子商务与安全国际研究大会)(ISECS 2009)
南昌
英文
934-938
2009-05-22(万方平台首次上网日期,不代表论文的发表时间)