...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Journal of Computers >Study on Trusting Relationship in Complex Network
【24h】

Study on Trusting Relationship in Complex Network

机译：复杂网络信任关系研究

获取原文
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

—In order to find the information dissemination rules in the social network, trusting relationship is proposed from a view of the influences of the members in a complex network. The basic metric, trusting value is defined to measure trusting degree between individuals in the network. A greedy algorithm with O(n2) time complexity is designed to calculate trusting values of all node pairs. Accordingly, the network average trust is introduced to measure the trusting degree of the whole network and node average trust is introduced to show the status of the certain node in the trusting network. These parameters are determined by individuals of the network and the network itself. Father calculating and analyzing have processed for different complex networks. The results confirm that network topology has a definite effect on the trusting relationship in a complex network. The characteristics of the small world and the free scale are beneficial to high network average trust and node average trust. The close trusting relationship is most conducive to the information dissemination and opinion communication in the network. Comparing with other methods, trusting relationship in a complex network can be used to analyze interaction in social network from the view of both the individual and the whole.
机译：- 为了在社交网络中找到信息传播规则，从成员在复杂网络中的影响方面提出了信任关系。基本度量标准，信任值被定义为测量网络中的个人之间的信任程度。具有O（n2）时间复杂度的贪婪算法旨在计算所有节点对的信任值。因此，引入了网络平均信任以测量整个网络的信任程度，并引入节点平均信任以显示信任网络中某个节点的状态。这些参数由网络的各个和网络本身确定。父亲计算和分析已经处理了不同的复杂网络。结果证实，网络拓扑对复杂网络中的信任关系具有明确的影响。小世界的特点和自由规模有利于高网络平均信任和节点平均信任。密切信任关系最有利于网络中信息传播和意见通信。与其他方法相比，复杂网络中的信任关系可用于从个人和整体的视野来分析社交网络中的互动。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号