%0 Journal Article
%T Effective parallel algorithm for mining frequent itemsets<br>一种有效的并行频繁项集挖掘算法*
%A WANG Dan-yang
%A TIAN Wei-dong
%A HU Xue-gang
%A <br>王丹阳
%A 田卫东
%A 胡学钢
%J 计算机应用研究
%D 2008
%I 
%X There were problems in traditional parallel algorithms for mining frequent itemsets,such as load imbalance,frequent synchronization,large scale communication and so on.Aiming at solving these problems,this paper proposed a parallel algorithm with multi-transmitting redistributed data(MRPD).In MRPD,data was redistributed into some groups at step l,and all the groups were multi-transmitted according to the request of computer nodes.Each node would compute frequent itemsets asynchronously after having received...
%K data mining
%K parallel algorithm
%K frequent itemsets<br>数据挖掘
%K 并行算法
%K 频繁项集
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=98BD4AF26253ACB1A3D4EF06195A8872&yid=67289AFF6305E306&vid=C5154311167311FE&iid=708DD6B15D2464E8&sid=50D9055BA6ACCE91&eid=F26D65CEFA9A860F&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=1&reference_num=7