首页> 外文会议>International Conference on Web-Age Information Management >Research and Implementation on Routing Scheme Based on Interest Mining in unstructured P2P Systems
【24h】

Research and Implementation on Routing Scheme Based on Interest Mining in unstructured P2P Systems

机译:基于非结构化P2P系统利息挖掘的路由方案的研究与实现

获取原文

摘要

In the environment of unstructured peer-to-peer (P2P), routing scheme is one of the key factors affecting information searches. A routing scheme based on interest indexical table is proposed in this paper. Moreover, on the basis of it, we implement a P2P full text information retrieval prototype system, Isearch. Firstly, we represent local file content of a peer with vector space model. After that, space vector is clustered to obtain interest class of this peer. And then, interest similar degree is computed among peers to build interest indexical table locally. When search occurs, query requests are forwarded to the peers with similar interest directly according to the interest indexical table. Experimental results show that Isearch doesn't have much influence on retrieval results, but also can reduce the number of query peers so that make routing more efficient.
机译:在非结构化点对点(P2P)的环境中,路由方案是影响信息搜索的关键因素之一。本文提出了一种基于兴趣指数表的路由方案。此外,在此基础上,我们实现了P2P全文信息检索原型系统,iSearch。首先,我们代表与矢量空间模型的对等体的本地文件内容。之后,空间向量被聚集以获得该对等体的兴趣类。然后,在对等体之间计算兴趣类似程度,以便在本地构建利息分子表。发生搜索时,根据兴趣指数表将查询请求转发到具有相似兴趣的对等体。实验结果表明,ISEART对检索结果没有太大影响,但也可以减少查询对等体的数量,以便更有效地进行路由。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号