Discovering Frequent Itemsets over P2P Network

Mining frequent item sets over P2P network is a challenging problem. The obstacles mainly lie in numerous frequent item sets and huge communication cost. To solve the two problems, a maximal item set mining algorithm P2PMaxSet is proposed. Firstly, only maximal item set is considered, which reduces the number of item sets greatly. Secondly, mining results are only interchanged between neighbor nodes, which save communication cost. Finally, adjust strategies are discussed for dynamic environment. Experimental results show P2PMaxSet is not only accurate but also with lower communication cost.