摘要
Trust and reputation are being used by e-commerce systems for online trading over the Web. Computing trust for an unknown agent in such an open environment is a demanding job. In order to solve the problem, a definition of trust scaling factor (TSF) has been proposed in this work. TSF has been implemented in two ways by modifying parallelization algorithm suggested for Bayesian social networks in [1], giving two novel trust computing algorithms. Performance of second algorithm has been compared with Beth, Borcherding and Klein (BBK) [2] under same situation showing a large reduction in impact of malicious agents.
| 源语言 | 英语 |
|---|---|
| 主期刊名 | 2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings - Computer, Optical and Broadband Communications, Computational Intelligence |
| 页 | 1641-1646 |
| 页数 | 6 |
| DOI | |
| 出版状态 | 已出版 - 2006 |
| 活动 | 2006 International Conference on Communications, Circuits and Systems, ICCCAS - Guilin, 中国 期限: 25 6月 2006 → 28 6月 2006 |
出版系列
| 姓名 | 2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings |
|---|---|
| 卷 | 3 |
会议
| 会议 | 2006 International Conference on Communications, Circuits and Systems, ICCCAS |
|---|---|
| 国家/地区 | 中国 |
| 市 | Guilin |
| 时期 | 25/06/06 → 28/06/06 |
指纹
探究 'Two novel trust evaluation algorithms' 的科研主题。它们共同构成独一无二的指纹。引用此
Durad, M. H., Cao, Y., & Liehuang, Z. (2006). Two novel trust evaluation algorithms. 在 2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings - Computer, Optical and Broadband Communications, Computational Intelligence (页码 1641-1646). 文章 4064214 (2006 International Conference on Communications, Circuits and Systems, ICCCAS, Proceedings; 卷 3). https://doi.org/10.1109/ICCCAS.2006.284988