Effective parallel algorithm for mining frequent itemsets
一种有效的并行频繁项集挖掘算法*

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...