Agent Trust Management Based on Human Plausible Reasoning: Application to Web Search

Sadra Abedinzadeh, S. Sadaoui
{"title":"Agent Trust Management Based on Human Plausible Reasoning: Application to Web Search","authors":"Sadra Abedinzadeh, S. Sadaoui","doi":"10.1109/SocialCom-PASSAT.2012.72","DOIUrl":null,"url":null,"abstract":"In open systems, different service providers can join and leave at any time. Multi Agent Systems (MASs) are being used more and more as the basis of open systems. Although openness brings a huge opportunity for different systems to operate in a decoupled and autonomous manner, it can introduce untrustworthy agents into the society. For this purpose, Agent Trust Management (ATM) methods have been proposed to try to eliminate this defect. This paper presents a general framework for managing trust in MASs based on the theory of Human Plausible Reasoning (HPR). The goal of the proposed framework is to determine for each user a ranked list of trusted agents and to find newer possible trust relationships between users and agents. We use the HPR certainty parameters to define how trustworthy each agent is in the list. We measure the agent trust according to two metrics: the direct interaction rating and third-party references. For each user, a third party is any other user with whom a HPR relationship exists. We aggregate the direct interaction rating value and the reputation values of third parties to achieve a single quantitative value for the trust. This value is then used to rank the agents. We apply our HPR-based ATM framework to the domain of Web search. The resulting ATM system provides the user a list of trusted search engines ranked according to the reputation the search engine has gained by interacting with other related users as well as the retrieval precision of pages returned in response to the user's query.","PeriodicalId":129526,"journal":{"name":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SocialCom-PASSAT.2012.72","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

In open systems, different service providers can join and leave at any time. Multi Agent Systems (MASs) are being used more and more as the basis of open systems. Although openness brings a huge opportunity for different systems to operate in a decoupled and autonomous manner, it can introduce untrustworthy agents into the society. For this purpose, Agent Trust Management (ATM) methods have been proposed to try to eliminate this defect. This paper presents a general framework for managing trust in MASs based on the theory of Human Plausible Reasoning (HPR). The goal of the proposed framework is to determine for each user a ranked list of trusted agents and to find newer possible trust relationships between users and agents. We use the HPR certainty parameters to define how trustworthy each agent is in the list. We measure the agent trust according to two metrics: the direct interaction rating and third-party references. For each user, a third party is any other user with whom a HPR relationship exists. We aggregate the direct interaction rating value and the reputation values of third parties to achieve a single quantitative value for the trust. This value is then used to rank the agents. We apply our HPR-based ATM framework to the domain of Web search. The resulting ATM system provides the user a list of trusted search engines ranked according to the reputation the search engine has gained by interacting with other related users as well as the retrieval precision of pages returned in response to the user's query.
基于人类似是而非推理的代理信任管理:在Web搜索中的应用
在开放系统中,不同的服务提供者可以随时加入或离开。多智能体系统(MASs)作为开放系统的基础被越来越多地使用。虽然开放为不同的系统以解耦和自治的方式运行带来了巨大的机会,但它也会将不可信的代理引入社会。为此,提出了Agent Trust Management (ATM)方法,试图消除这一缺陷。本文提出了一个基于人类似是而非推理理论的大众信任管理的总体框架。提出的框架的目标是为每个用户确定可信代理的排序列表,并在用户和代理之间找到更新的可能的信任关系。我们使用HPR确定性参数来定义列表中每个代理的可信程度。我们根据两个指标来衡量代理信任:直接交互评级和第三方参考。对于每个用户,第三方是与HPR存在关系的任何其他用户。我们将直接互动评级值和第三方的声誉值汇总起来,以获得信任的单一定量值。然后使用该值对代理进行排序。我们将基于hpr的ATM框架应用于Web搜索领域。由此产生的ATM系统根据搜索引擎通过与其他相关用户交互获得的声誉以及响应用户查询返回的页面的检索精度,为用户提供了一个可信搜索引擎列表。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信