计算机应用

• 数据挖掘 • 上一篇    下一篇

P2P网络中的数据挖掘

刘天鹏 周娅   

  1. 桂林电子科技大学 桂林电子科技大学
  • 收稿日期:2007-07-13 修回日期:2007-09-05 发布日期:2008-01-01 出版日期:2008-01-01
  • 通讯作者: 刘天鹏

Data mining in P2P networks

<a href="http://www.joca.cn/EN/article/advancedSearchResult.do?searchSQL=(((Tian-Peng LIU[Author]) AND 1[Journal]) AND year[Order])" target="_blank">Tian-Peng LIU</a>   

  • Received:2007-07-13 Revised:2007-09-05 Online:2008-01-01 Published:2008-01-01
  • Contact: Tian-Peng LIU

摘要: 在分析了现有分布式数据挖掘算法的运行机制和P2P技术具有无中心、不同步等特点的基础上,通过扩展经典K-mean算法的迭代过程,设计了一种能够用于P2P网络的分布式数据挖掘算法。该算法只需要在直接相连的节点间传递数据,并且能使每个节点上的数据按照全局聚类的结果聚合。最后用模拟实验验证了该算法的有效性。

关键词: K-mean算法, 分布式数据挖掘, 对等网, 聚类

Abstract: To analyze both the operational mechanism of current distributed data mining and the characteristics of the P2P technology: non-centralized peer and asynchronism, by extending the iterative process of classical K-mean algorithm, a distributed data mining algorithm was designed in this paper to implement k-mean thinking in a P2P networks. This algorithm exchanges information only between directly connected nodes, and can cluster local data on each peer in a global view. Finally, simulation experiments show that the algorithm is effective and accurate.

Key words: K-mean, Distributed Data Mining, P2P, Clustering