SWTrust:在线社交网络信任评估的可信图生成

Wenjun Jiang, Guojun Wang
{"title":"SWTrust:在线社交网络信任评估的可信图生成","authors":"Wenjun Jiang, Guojun Wang","doi":"10.1109/TrustCom.2011.251","DOIUrl":null,"url":null,"abstract":"To solve the problem of \"Can Alice trust Bob on a service in a social network setting\", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.","PeriodicalId":289926,"journal":{"name":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"27","resultStr":"{\"title\":\"SWTrust: Generating Trusted Graph for Trust Evaluation in Online Social Networks\",\"authors\":\"Wenjun Jiang, Guojun Wang\",\"doi\":\"10.1109/TrustCom.2011.251\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To solve the problem of \\\"Can Alice trust Bob on a service in a social network setting\\\", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.\",\"PeriodicalId\":289926,\"journal\":{\"name\":\"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"27\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/TrustCom.2011.251\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TrustCom.2011.251","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 27

摘要

为了解决“Alice能否信任Bob在社交网络环境下的服务”问题,我们提出了SWTrust框架来生成在线社交网络中用于信任评估的可信图:(1)开发一种新的PSN算法用于预处理社交网络,根据用户的社交距离对邻居进行分类,并根据邻居的主题关联度和目标关联度定义邻居的优先级;(2)开发分布式算法构建信任网络(BTN)和生成信任图(GTG)。基于Epinions.com数据的实验结果表明,我们的方法可以有效地发现短路径并生成高质量的可信图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SWTrust: Generating Trusted Graph for Trust Evaluation in Online Social Networks
To solve the problem of "Can Alice trust Bob on a service in a social network setting", we propose the SWTrust framework to generate trusted graphs for trust evaluation in online social networks: (1) to develop a novel PSN algorithm for preprocessing a social network, where we classify a user's neighbors by their social distance and define neighbors' priority based on their topic-related degree and target-related degree, (2) to develop distributed algorithms to build trust network (BTN) and to generate trusted graph (GTG). Experimental results with data from Epinions.com show that our work can discover short paths and generate high quality trusted graphs efficiently.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信