Fast Distributed Mining Algorithm of Maximum Frequent Itemsets Based on Cloud Computing

被引:0
作者
He, Bo [1 ]
机构
[1] Chongqing Univ Technol, Sch Comp Sci & Engn, Chongqing 400054, Peoples R China
来源
INFORMATION COMPUTING AND APPLICATIONS, ICICA 2013, PT I | 2013年 / 391卷
关键词
Data Mining; Cloud Computing; Maximum Frequent Itemsets; LOCAL OUTLIERS;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The paper proposed a fast distributed mining algorithm of maximum frequent itemsets based on cloud computing, namely, FDMMFI algorithm. FDMMFI algorithm made nodes compute local maximum frequent itemsets by cloud computing, then the center node exchanged data with other nodes and combined, finally, global maximum frequent itemsets were gained by cloud computing. Theoretical analysis and experimental results suggest that under the same minimum support threshold, communication traffic and runtime of FDMMFI decreases while comparing with CD and FDM. The less the minimum support threshold, the better the three performance parameters of FDMMFI. FDMMFI algorithm is fast and effective.
引用
收藏
页码:407 / 416
页数:10
相关论文
共 25 条
[21]  
Mao YX, 2010, LECT NOTES ARTIF INT, V5990, P82
[22]  
Merz G., 1996, TECHNICAL REPORT
[23]  
Song Yu-Qing, 2003, Journal of Software, V14, P1586
[24]   Cherry: An algorithm for mining frequent closed itemsets without subset checking [J].
Tao, Li-Min ;
Huang, Lin-Peng .
Ruan Jian Xue Bao/Journal of Software, 2008, 19 (02) :379-388
[25]  
[王黎明 Wang Liming], 2007, [计算机研究与发展, Journal of Computer Research and Development], V44, P445, DOI 10.1360/crad20070312