Discovering Frequent Itemsets over P2P Network

2011 International Conference on Internet Computing and Information Services Pub Date : 2011-09-17 DOI:10.1109/ICICIS.2011.104

Wei Song, Lei Gao, Junshan Wang, Jinhong Li

引用次数: 0

Abstract

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.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

发现P2P网络上的频繁项集

P2P网络中频繁项集的挖掘是一个具有挑战性的问题。障碍主要在于项目集频繁，沟通成本大。为了解决这两个问题，提出了一种最大项目集挖掘算法P2PMaxSet。首先，只考虑最大项目集，大大减少了项目集的数量;其次，挖掘结果只在相邻节点之间交换，节省了通信成本;最后，讨论了动态环境下的调整策略。实验结果表明，P2PMaxSet不仅精度高，而且通信成本低。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

2011 International Conference on Internet Computing and Information Services

自引率

0.00%

发文量

期刊最新文献

Telephone Clients Management System with Short Messages The Analysis on the Function of Risk Management in Construction Enterprises Development Test Case Prioritization Technique Based on Genetic Algorithm A Model to Create Graeco Latin Square Using Genetic Algorithm Perceptual System of the Dangerous Goods in Transit Escort Based on WSN