首页> 外文会议>International Conference on Machine Learning and Cybernetics >A SCHEME FOR SOLVING D-S THEORY BASED IGNORANT EVIDENCE FUSION IN P2P NETWORK
【24h】

A SCHEME FOR SOLVING D-S THEORY BASED IGNORANT EVIDENCE FUSION IN P2P NETWORK

机译:基于D-S理论的P2P网络中的无知证据融合的方案

获取原文
获取外文期刊封面目录资料

摘要

For most P2P file-swapping applications, sharing is a volunteer action, and peers are not responsible for their irresponsible bartering history. It is necessary to establish a trust mechanism for the P2P network. Among the existing trust models based on recommendation, the Dempster-Shafer (D-S) evidence theory can solve uncertain problem. But in the existing researches on D-S evidence theory, no one aware the problem of logical evidence fusion when there is a large number of the ignorant evidence in the evidence space. In this paper, we establish a new the D-S evidence theory scheme toenhance the P2P network security.
机译:对于大多数P2P文件交换应用程序,共享是志愿者动作,并且对同行对其不负责任的交换历史负责。有必要为P2P网络建立一个信任机制。在基于推荐的现有信任模型中,Dempster-Shafer(D-S)证据理论可以解决不确定的问题。但在对D-S证据理论的现有研究中,没有人意识到在证据空间中有大量无知证据时逻辑证据融合的问题。在本文中,我们建立了一种新的D-S证据理论计划,使P2P网络安全性成为努力。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号