The paper proposes a distributed algorithm for mining association rules based on frequent pattern tree(FP-tree),
named distributed algorithm for mining association rules based on FP-tree(DMARF) algorithm, which sets center node.
DMARF algorithm makes computer nodes compute local frequent itemsets independently from the local FP-tree. Then the
center node exchanges data with other computer nodes. Finally, global frequent itemsets are gained. DMARF can decrease
candidate itemsets and communication traffic by using the strategies of top and bottom. Theoretical analysis and experimental
results show that DMARF algorithm is fast and effective.