| 信任网络中的依赖关系分析与消除 |
| |
| 引用本文： | 蒋黎明,张琨,徐建,张宏.信任网络中的依赖关系分析与消除[J].计算机科学,2011,38(6):70-73. |
| |
| 作者姓名： | 蒋黎明 张琨 徐建 张宏 |
| |
| 作者单位： | 1. 南京理工大学计算机科学与技术学院,南京,210094
2. 南京理工大学计算机科学与技术学院,南京,210094;南京大学计算机软件新技术国家重点实验室,南京,210094 |
| |
| 基金项目： | 本文受国家白然科学基金资助项目(90718021，江苏省自然科学基金项目(SBK201022379),高等学校博士学科点专项科研基金(20093219120024)，自主科研专项计划((2010ZYTS036}资助。 |
| |
| 摘 要： | 针对现有的信任聚合方法普遍存在因推荐信息损耗或重复计算等导致信任度量结果与直接推荐之间偏差增大的问题，首先引入信任子图及左部与右部结点等相关概念，并证明了信任子图中依赖关系与结点入度及出度之间的关联性，在此基础上，提出了一种有效的依赖关系消除算法，最后，给出了一个数值计算实例来说明该方法的可行性和有效性。
|
| 关 键 词： | 信任网络，信任聚合，信任子图，依赖关系 |
Analysis and Elimination of the Dependent Relationships in Trust Networks |
| |
| JIANG Li-ming,ZHANG Kun,XU Jian,ZHANG Hong.Analysis and Elimination of the Dependent Relationships in Trust Networks[J].Computer Science,2011,38(6):70-73. |
| |
| Authors: | JIANG Li-ming ZHANG Kun XU Jian ZHANG Hong |
| |
| Affiliation: | (Institute of Computer Science and Technology,Nanjing University of Science and Technology, Nanjing 210094,China) (State Key Laboratory for Novel Software Technology,Nanjing University,Nanjing 210094,China) |
| |
| Abstract: | Current trust aggregation methods have the problems of information loss or repetitive calculation that limit analysis and disposal of the dependent relationships in transitivity trust networks, which leads to the deviation between the computation trust value and the direct recommendation increasing. This article introduced a definition of trust subgraph, combined with its left neighboring nodes and right neighboring nodes, proved the existence of a relationship between the dependent relationships and the in-degree and out degree of nodes in trust graph, we proposed an algorithm to eliminate the dependency existed in trust graph. We also provided a numerical example to illustrate the validity and feasibility of our method. |
| |
| Keywords: | Trust networks Trust aggregation Trust sulrgraph Dependent relationships |
| 本文献已被 万方数据 等数据库收录！ |
|
点击此处可从《计算机科学》下载全文 |
|
