Not Every Friend on a Social Network Can be Trusted: An Online Trust Indexing Algorithm

R. Tang, Luke Lu, Zhuang Yan, S. Fong
{"title":"Not Every Friend on a Social Network Can be Trusted: An Online Trust Indexing Algorithm","authors":"R. Tang, Luke Lu, Zhuang Yan, S. Fong","doi":"10.1109/WI-IAT.2012.84","DOIUrl":null,"url":null,"abstract":"Online social network has become prevalent in our modern lifestyle by which one can easily connect and share information with anybody around the world. Facebook, Twitter, Flicker, Sina Weibo, are some exemplars nowadays. As the population of users in social networks grows, the concern of security in using such network escalates too. The social network is formed by people from all walks of life. Since there is little physical interaction available, it is difficult to verify whether social network users are trustworthy or not. In this paper, we propose a method that assists users to infer the degree of trustworthiness in social network. A quantitative indicator, which we call it Trust Index (TI) is assigned to each user, so one can have a ranked list of users, those with the greatest values of TI appear on top and vice versa. This serves as a reference for a user to decide how much s/he would want to trust them in social networks. TI is calculated based on the distance in terms of hop counts that measures how far apart between the user and s/he peer is. The distance is estimated by referring to relation as well as how acquainted the test user is with respect to some verified icons (public figures which have already been verified by the social network administrators) in social networks. Our TI algorithm also could enlist a group of people whose TIs fall below a given threshold, these are the users that need to be cautious about.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IAT.2012.84","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Online social network has become prevalent in our modern lifestyle by which one can easily connect and share information with anybody around the world. Facebook, Twitter, Flicker, Sina Weibo, are some exemplars nowadays. As the population of users in social networks grows, the concern of security in using such network escalates too. The social network is formed by people from all walks of life. Since there is little physical interaction available, it is difficult to verify whether social network users are trustworthy or not. In this paper, we propose a method that assists users to infer the degree of trustworthiness in social network. A quantitative indicator, which we call it Trust Index (TI) is assigned to each user, so one can have a ranked list of users, those with the greatest values of TI appear on top and vice versa. This serves as a reference for a user to decide how much s/he would want to trust them in social networks. TI is calculated based on the distance in terms of hop counts that measures how far apart between the user and s/he peer is. The distance is estimated by referring to relation as well as how acquainted the test user is with respect to some verified icons (public figures which have already been verified by the social network administrators) in social networks. Our TI algorithm also could enlist a group of people whose TIs fall below a given threshold, these are the users that need to be cautious about.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
并非社交网络上的每个朋友都可以信任:一种在线信任索引算法
在线社交网络在我们的现代生活方式中已经变得很普遍,人们可以很容易地与世界各地的任何人联系和分享信息。Facebook, Twitter, Flicker,新浪微博就是现在的一些例子。随着社交网络用户数量的增长,人们对社交网络安全问题的担忧也在不断升级。社会网络是由各行各业的人组成的。由于很少有实际的互动,很难验证社交网络用户是否值得信赖。在本文中,我们提出了一种帮助用户推断社交网络可信度的方法。给每个用户分配一个定量指标,我们称之为信任指数(TI),因此可以有一个用户排名列表,TI值最大的用户出现在顶部,反之亦然。这可以作为用户决定在社交网络中信任他们多少的参考。TI是根据跳数计算的距离来计算的,跳数衡量用户和对等体之间的距离。通过参考测试用户对社交网络中某些已验证的图标(已被社交网络管理员验证的公众人物)的关系和熟悉程度来估计距离。我们的TI算法还可以招募一组TI低于给定阈值的人,这些用户需要谨慎对待。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Conceptualization Effects on MEDLINE Documents Classification Using Rocchio Method Keyword Proximity Search over Large and Complex RDF Database Cognitive-Educational Constraints for Socially-Relevant MALL Technologies Mining Criminal Networks from Chat Log Inferring User Context from Spatio-Temporal Pattern Mining for Mobile Application Services
×
引用
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