Bayesian Inference in Trust Networks

L. Orman
{"title":"Bayesian Inference in Trust Networks","authors":"L. Orman","doi":"10.1145/2489790","DOIUrl":null,"url":null,"abstract":"Trust has emerged as a major impediment to the success of electronic markets and communities where interaction with the strangers is the norm. Social Networks and Online Communities enable interaction with complete strangers, and open up new commercial, political, and social possibilities. But those promises are rarely achieved because it is difficult to trust the online contacts. A common approach to remedy this problem is to compute trust values for the new contacts from the existing trust values in the network. There are two main methods: aggregation and transitivity. Yet, neither method provides satisfactory results because trust networks are sparse and transitivity may not hold. This article develops a Bayesian formulation of the problem, where trust is defined as a conditional probability, and a Bayesian Network analysis is employed to compute the unknown trust values in terms of the known trust values. The algorithms used to propagate conditional probabilities through the network are theoretically sound and based on a long-standing literature on probability propagation in Bayesian networks. Moreover, the context information that is typically ignored in trust literature is included here as a major factor in computing new trust values. These changes have led to significant improvements over existing approaches in the accuracy of computed trust, and with some modifications to the algorithm, in its reach. Real data acquired from Advogato network is used to do extensive testing, and the results confirm the practical value of a theoretically sound Bayesian approach.","PeriodicalId":178565,"journal":{"name":"ACM Trans. Manag. Inf. Syst.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Trans. Manag. Inf. Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2489790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

Abstract

Trust has emerged as a major impediment to the success of electronic markets and communities where interaction with the strangers is the norm. Social Networks and Online Communities enable interaction with complete strangers, and open up new commercial, political, and social possibilities. But those promises are rarely achieved because it is difficult to trust the online contacts. A common approach to remedy this problem is to compute trust values for the new contacts from the existing trust values in the network. There are two main methods: aggregation and transitivity. Yet, neither method provides satisfactory results because trust networks are sparse and transitivity may not hold. This article develops a Bayesian formulation of the problem, where trust is defined as a conditional probability, and a Bayesian Network analysis is employed to compute the unknown trust values in terms of the known trust values. The algorithms used to propagate conditional probabilities through the network are theoretically sound and based on a long-standing literature on probability propagation in Bayesian networks. Moreover, the context information that is typically ignored in trust literature is included here as a major factor in computing new trust values. These changes have led to significant improvements over existing approaches in the accuracy of computed trust, and with some modifications to the algorithm, in its reach. Real data acquired from Advogato network is used to do extensive testing, and the results confirm the practical value of a theoretically sound Bayesian approach.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
信任网络中的贝叶斯推理
在与陌生人互动已成为常态的电子市场和社区中,信任已成为取得成功的主要障碍。社交网络和在线社区使人们能够与完全陌生的人互动,并开辟了新的商业、政治和社会可能性。但这些承诺很少实现,因为很难信任在线联系人。解决此问题的一种常用方法是根据网络中现有的信任值计算新联系人的信任值。有两种主要方法:聚合和传递性。然而,这两种方法都不能提供令人满意的结果,因为信任网络是稀疏的,传递性可能不成立。本文发展了该问题的贝叶斯公式,其中将信任定义为条件概率,并使用贝叶斯网络分析根据已知信任值计算未知信任值。用于通过网络传播条件概率的算法在理论上是合理的,并且基于贝叶斯网络中概率传播的长期文献。此外,在信任文献中通常被忽略的上下文信息被包括在内,作为计算新信任值的主要因素。这些变化大大提高了计算信任的准确性,并对算法进行了一些修改。利用从Advogato网络获取的真实数据进行了大量的测试,结果证实了理论上合理的贝叶斯方法的实用价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Using Social Media to Analyze Public Concerns and Policy Responses to COVID-19 in Hong Kong COVID-Safe Spatial Occupancy Monitoring Using OFDM-Based Features and Passive WiFi Samples SymptomID: A Framework for Rapid Symptom Identification in Pandemics Using News Reports Leveraging Individual and Collective Regularity to Profile and Segment User Locations from Mobile Phone Data Write Like a Pro or an Amateur? Effect of Medical Language Formality
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1