首页 | 本学科首页   官方微博 | 高级检索  
     

P2P网络中基于增量学习的节点聚类
引用本文:张化祥,刘培德,黄上腾.P2P网络中基于增量学习的节点聚类[J].计算机科学,2005,32(12):184-187.
作者姓名:张化祥  刘培德  黄上腾
作者单位:山东师范大学计算机科学系,济南,250014;山东经济学院计算机系,济南,250014;上海交通大学计算机科学与工程系,上海,200030
摘    要:本文研究了p2p网络中基于内容的节点聚类。基于文件名关键词精确匹配的查询没有考虑文本语义及内容相似性。如果能够根据节点发布内容的相似性,建立节点聚类,信息查询在类内进行,必将提高查询效率。本文提出了一种基于增量学习的节点聚类方法,通过兴趣爬虫代理计算节点得分,据此判断一个节点是否可以加入节点簇。实验表明,节点簇的建立可以有效地提高 p2p 网络的查询效率。

关 键 词:对等网络  聚类  增量学习

Peer Clustering Based on Incremental Learning in P2P Networks
ZHANG Hua-Xiang,LIU Pei-De,HUANG Shang-Teng.Peer Clustering Based on Incremental Learning in P2P Networks[J].Computer Science,2005,32(12):184-187.
Authors:ZHANG Hua-Xiang  LIU Pei-De  HUANG Shang-Teng
Abstract:This paper discusses the content-based peer clustering in peer-to-peer networks.Information retrieval based on accurate match of keywords in filenames ignores the document semantics and the similarity between documents.If peers are clustered according to the similarity between their released documents of a special interest topic,and the in- formation query is executed among peers of a specific cluster,the efficiency should be improved.We propose an incre- mental learning approach to peer clustering,and employ an interest crawler agent to calculate a peer's score.Whether a peer joins in a cluster or not is determined by its score.Experimental results demonstrate that clustering of peers in hybrid p2p networks is both accurate and more efficient for irformation retrieval.
Keywords:Peer-to-peer networks  Cluster  Incremental learning
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机科学》浏览原始摘要信息
点击此处可从《计算机科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号