多智能体电子商务系统中基于信誉的信任网络建模与简化

Zaobin Gan, Qian Ding, V. Varadharajan
{"title":"多智能体电子商务系统中基于信誉的信任网络建模与简化","authors":"Zaobin Gan, Qian Ding, V. Varadharajan","doi":"10.1109/NWESP.2009.13","DOIUrl":null,"url":null,"abstract":"In this paper, we present a description model of a Trust Network Graph (TNG)-for multi-agent-based e-commerce systems, which is similar to the relationship network formed among people’s transaction activities in the real-world. The method assumes that a multi-agent system in a domain constitutes a community and so the trust network is modelled by the means of a graph in the community. Several notations and regulations are defined in the description model of TNG. In order to sweep out redundancy information in the TNG and reduce the complexity of the trust computation, we propose the principles and the processes of simplification, the definition and the selection algorithm of Optimized Path for Recommendation Propagation (OPRP) in terms of the trust commonsense in people’s daily life. The examples in this paper show that TNG can describe the complex trust relationships in mutliagent e-commerce systems and help simplify the algorithms of the trust evaluation.","PeriodicalId":326450,"journal":{"name":"2009 Fifth International Conference on Next Generation Web Services Practices","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Reputation-Based Trust Network Modelling and Simplification in Multiagent-Based E-Commerce Systems\",\"authors\":\"Zaobin Gan, Qian Ding, V. Varadharajan\",\"doi\":\"10.1109/NWESP.2009.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present a description model of a Trust Network Graph (TNG)-for multi-agent-based e-commerce systems, which is similar to the relationship network formed among people’s transaction activities in the real-world. The method assumes that a multi-agent system in a domain constitutes a community and so the trust network is modelled by the means of a graph in the community. Several notations and regulations are defined in the description model of TNG. In order to sweep out redundancy information in the TNG and reduce the complexity of the trust computation, we propose the principles and the processes of simplification, the definition and the selection algorithm of Optimized Path for Recommendation Propagation (OPRP) in terms of the trust commonsense in people’s daily life. The examples in this paper show that TNG can describe the complex trust relationships in mutliagent e-commerce systems and help simplify the algorithms of the trust evaluation.\",\"PeriodicalId\":326450,\"journal\":{\"name\":\"2009 Fifth International Conference on Next Generation Web Services Practices\",\"volume\":\"31 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Fifth International Conference on Next Generation Web Services Practices\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NWESP.2009.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Next Generation Web Services Practices","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NWESP.2009.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种基于多代理的电子商务系统信任网络图(TNG)的描述模型,该模型类似于现实世界中人们的交易活动之间形成的关系网络。该方法假设一个领域内的多智能体系统构成了一个社区,并利用社区中的图对信任网络进行建模。在TNG的描述模型中定义了几种符号和规则。为了清除TNG中的冗余信息,降低信任计算的复杂度,我们根据人们日常生活中的信任常识,提出了优化推荐传播路径(OPRP)的简化原则和过程、定义和选择算法。本文的实例表明,TNG可以描述多智能体电子商务系统中复杂的信任关系,有助于简化信任评估的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reputation-Based Trust Network Modelling and Simplification in Multiagent-Based E-Commerce Systems
In this paper, we present a description model of a Trust Network Graph (TNG)-for multi-agent-based e-commerce systems, which is similar to the relationship network formed among people’s transaction activities in the real-world. The method assumes that a multi-agent system in a domain constitutes a community and so the trust network is modelled by the means of a graph in the community. Several notations and regulations are defined in the description model of TNG. In order to sweep out redundancy information in the TNG and reduce the complexity of the trust computation, we propose the principles and the processes of simplification, the definition and the selection algorithm of Optimized Path for Recommendation Propagation (OPRP) in terms of the trust commonsense in people’s daily life. The examples in this paper show that TNG can describe the complex trust relationships in mutliagent e-commerce systems and help simplify the algorithms of the trust evaluation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信