基于图形数据库的社交媒体虚假用户检测

Yichun Zhao, Jens Weber
{"title":"基于图形数据库的社交媒体虚假用户检测","authors":"Yichun Zhao, Jens Weber","doi":"10.18357/tar121202120027","DOIUrl":null,"url":null,"abstract":"Social media has become a major part of people’s daily lives as it provides users with the convenience to connect with people, interact with friends, share personal content with others, and gather information. However, it also creates opportunities for fake users. Fake users on social media may be perceived as popular and influential if not detected. They might spread false information or fake news by making it look real, manipulating real users into making  certain decisions. In computer science, a social network can be treated as a graph, which is a data structure consisting of nodes being the social media users, and edges being the connections between users. Graph data can be stored in a graph database for efficient data analysis. In this paper, we propose using a graph database to achieve an increased scalability to accommodate larger graphs. Centrality measures as features were extracted for the random forest classifier to successfully detect fake users with high precision, recall, and accuracy. We have achieved promising results especially when compared with previous studies.  \n ","PeriodicalId":143772,"journal":{"name":"The Arbutus Review","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Detecting Fake Users on Social Media with a Graph Database\",\"authors\":\"Yichun Zhao, Jens Weber\",\"doi\":\"10.18357/tar121202120027\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social media has become a major part of people’s daily lives as it provides users with the convenience to connect with people, interact with friends, share personal content with others, and gather information. However, it also creates opportunities for fake users. Fake users on social media may be perceived as popular and influential if not detected. They might spread false information or fake news by making it look real, manipulating real users into making  certain decisions. In computer science, a social network can be treated as a graph, which is a data structure consisting of nodes being the social media users, and edges being the connections between users. Graph data can be stored in a graph database for efficient data analysis. In this paper, we propose using a graph database to achieve an increased scalability to accommodate larger graphs. Centrality measures as features were extracted for the random forest classifier to successfully detect fake users with high precision, recall, and accuracy. We have achieved promising results especially when compared with previous studies.  \\n \",\"PeriodicalId\":143772,\"journal\":{\"name\":\"The Arbutus Review\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Arbutus Review\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18357/tar121202120027\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Arbutus Review","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18357/tar121202120027","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

社交媒体已经成为人们日常生活的重要组成部分,因为它为用户提供了与人联系,与朋友互动,与他人分享个人内容以及收集信息的便利。然而,这也为虚假用户创造了机会。如果不被发现,社交媒体上的假用户可能会被认为是受欢迎和有影响力的。他们可能会传播虚假信息或假新闻,使其看起来真实,操纵真实用户做出某些决定。在计算机科学中,社交网络可以看作是一个图,它是一种数据结构,节点是社交媒体用户,边是用户之间的连接。图形数据可以存储在图形数据库中,以便进行有效的数据分析。在本文中,我们建议使用图形数据库来实现更高的可伸缩性,以适应更大的图形。随机森林分类器提取中心性度量作为特征,以高精度、召回率和准确性成功检测假用户。特别是与以往的研究相比,我们取得了可喜的成果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Detecting Fake Users on Social Media with a Graph Database
Social media has become a major part of people’s daily lives as it provides users with the convenience to connect with people, interact with friends, share personal content with others, and gather information. However, it also creates opportunities for fake users. Fake users on social media may be perceived as popular and influential if not detected. They might spread false information or fake news by making it look real, manipulating real users into making  certain decisions. In computer science, a social network can be treated as a graph, which is a data structure consisting of nodes being the social media users, and edges being the connections between users. Graph data can be stored in a graph database for efficient data analysis. In this paper, we propose using a graph database to achieve an increased scalability to accommodate larger graphs. Centrality measures as features were extracted for the random forest classifier to successfully detect fake users with high precision, recall, and accuracy. We have achieved promising results especially when compared with previous studies.   
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Healthy Neuroticism, Daily Physical Activity, and Daily Stress in Older Adults FM 3-24 and Religious Literacy in American Military Operations in the Middle East The Annexation of Crimea and EU Sanctions: An Ineffective Response The River’s Legal Personhood: A Branch Growing on Canada’s Multi-Juridical Living Tree Marrying Christ: Bernard of Clairvaux and the Song of Songs in Aemilia Lanyer’s "Salve Deus Rex Judaeorum"
×
引用
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