Discovering Frequent Itemsets over P2P Network

摘要：

Mining frequent itemsets over P2P network is a challenging problem.The obstacles mainly lie in numerous frequent itemsets and huge communication cost.To solve the two problems,a maximal itemset mining algorithm P2PMaxSet is proposed.Firstly,only maximal itemset is considered,which reduces the number of itemsets 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.

关键词： data mining P2P network maximal frequent itemset

作者: Wei Song Lei Gao Junshan Wang Jinhong Li

作者单位: College of Information Engineering North China University of Technology,Beijing 100144,China

会议类型: 国际会议

会议名称: 2010 4th International Conference on Intelligent Information Techonlogy Application(第四届智能信息技术应用国际学术研讨会 IITA 2010)

会议地点: 秦皇岛

会议语种:英文

页码: 19-22

在线出版日期: 2010-11-05（万方平台首次上网日期，不代表论文的发表时间）