| 基于蚁群算法的信任路径寻找算法 |
| |
| 引用本文： | 高承实,王建政,张 栋.基于蚁群算法的信任路径寻找算法[J].计算机工程与应用,2007,43(15):131-133. |
| |
| 作者姓名： | 高承实 王建政 张 栋 |
| |
| 作者单位： | 解放军信息工程大学电子技术学院,郑州450004 |
| |
| 摘 要： | 传统推荐信任模型中单纯采用概率平均的方法得到推荐信任值,这种方法效率较低,而且难以抵抗联合欺诈行为。基于蚁群算法给出了一个寻找信任路径的算法,该算法通过多次循环选出多条较优的独立信任路径,在一定程度上可有效防止联合欺诈行为,并通过实验证明了它的有效性,适应现实的复杂网络环境。
|
| 关 键 词： | 蚁群算法 信任 信任管理模型 |
| 文章编号： | 1002-8331（2007）15-0131-03 |
| 修稿时间： | 2006-09 |
Searching trust path model based on ant colony algorithm |
| |
| GAO Cheng-shi,WANG Jian-zheng,ZHANG Dong.Searching trust path model based on ant colony algorithm[J].Computer Engineering and Applications,2007,43(15):131-133. |
| |
| Authors: | GAO Cheng-shi WANG Jian-zheng ZHANG Dong |
| |
| Affiliation: | Institute of Electronic Technology,the PLA University of Information Engineering,Zhengzhou 450004,China |
| |
| Abstract: | The value of recommendation trust is evaluated by probability average method in traditional recommendation trust model.But the method has low efficiency,and is difficult to resist the unite cheat behavior.This paper presents a searching trust path model based on ant colony algorithm,which is able to choice many better independence paths by a few circles.The algorithm is able to prevent unite cheat behavior in a certain extent.At last,some emulation experiments are offered to show that the algorithm is efficient and valuable in earthy complex network environment. |
| |
| Keywords: | ant colony algorithm trust trust management model |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
