Graph-Based Rumor Detection on Social Media Using Posts and Reactions

Nareshkumar R, N. K, Sujatha R, Shakila Banu S, Sasikumar P, Balamurugan P
{"title":"Graph-Based Rumor Detection on Social Media Using Posts and Reactions","authors":"Nareshkumar R, N. K, Sujatha R, Shakila Banu S, Sasikumar P, Balamurugan P","doi":"10.12785/ijcds/160114","DOIUrl":null,"url":null,"abstract":": In this article, researchers deliver a novel method that makes use of graph-based contextual and semantic learning to detect rumors. Social media platforms are interconnected, so when an event occurs, similar news or user reactions with common interests are disseminated throughout the network. The presented research introduces an innovative graph-based method for identifying rumors on social media by analyzing both posts and reactions. Identifying and dealing with online rumors is an important and increasing di ffi culty. We use real-world social media data to create a solution based on data analysis. The process involves creating graphs, identifying bridge words, and selecting features. The proposed method shows better performance than the baselines, indicating its e ff ectiveness in addressing this significant issue. The method that is being o ff ered makes use of tweets and people’s replies to them in order to comprehend the fundamental interaction patterns and make use of the textual and hidden information. The primary emphasis of this e ff ort is developing a reliable graph-based analyzer that can identify rumors spread on social media. The modeling of textual data as a words co-occurrence graph results in the production of two prominent groups of significant words and bridge connection words. Using these words as building pieces, contextual patterns for rumor detection may be constructed and detected using node-level statistical measurements. The identification of unpleasant feelings and inquisitive components in the responses further enriches the contextual patterns. The recommended technique is assessed by means of the PHEME dataset, which is open to the public, and contrasted with a variety of baselines as well as our suggested approaches. The results of the experiments are encouraging, and the strategy that was suggested seems to be helpful for rumor identification on social media platforms online.","PeriodicalId":37180,"journal":{"name":"International Journal of Computing and Digital Systems","volume":"148 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computing and Digital Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12785/ijcds/160114","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

: In this article, researchers deliver a novel method that makes use of graph-based contextual and semantic learning to detect rumors. Social media platforms are interconnected, so when an event occurs, similar news or user reactions with common interests are disseminated throughout the network. The presented research introduces an innovative graph-based method for identifying rumors on social media by analyzing both posts and reactions. Identifying and dealing with online rumors is an important and increasing di ffi culty. We use real-world social media data to create a solution based on data analysis. The process involves creating graphs, identifying bridge words, and selecting features. The proposed method shows better performance than the baselines, indicating its e ff ectiveness in addressing this significant issue. The method that is being o ff ered makes use of tweets and people’s replies to them in order to comprehend the fundamental interaction patterns and make use of the textual and hidden information. The primary emphasis of this e ff ort is developing a reliable graph-based analyzer that can identify rumors spread on social media. The modeling of textual data as a words co-occurrence graph results in the production of two prominent groups of significant words and bridge connection words. Using these words as building pieces, contextual patterns for rumor detection may be constructed and detected using node-level statistical measurements. The identification of unpleasant feelings and inquisitive components in the responses further enriches the contextual patterns. The recommended technique is assessed by means of the PHEME dataset, which is open to the public, and contrasted with a variety of baselines as well as our suggested approaches. The results of the experiments are encouraging, and the strategy that was suggested seems to be helpful for rumor identification on social media platforms online.
利用帖子和回复在社交媒体上进行基于图谱的谣言检测
:在这篇文章中,研究人员提出了一种利用基于图的上下文和语义学习来检测谣言的新方法。社交媒体平台是相互关联的,因此当事件发生时,具有共同利益的类似新闻或用户反应会在整个网络中传播。本研究介绍了一种基于图的创新方法,通过分析帖子和反应来识别社交媒体上的谣言。识别和处理网络谣言是一项重要且日益严峻的挑战。我们利用真实世界的社交媒体数据,在数据分析的基础上创建了一个解决方案。这一过程包括创建图表、识别桥词和选择特征。所提出的方法显示出比基线方法更好的性能,表明其在解决这一重大问题方面的有效性。所提出的方法利用推文和人们对推文的回复来理解基本的互动模式,并利用文本信息和隐藏信息。这项研究的重点是开发一种可靠的基于图的分析器,以识别社交媒体上传播的谣言。将文本数据建模为词语共现图后,会产生两组突出的重要词语和桥梁连接词语。利用这些词语作为构建片段,可以构建用于谣言检测的上下文模式,并通过节点级统计测量进行检测。在回答中识别出不愉快的感觉和好奇的成分,进一步丰富了语境模式。我们通过向公众开放的 PHEME 数据集对所推荐的技术进行了评估,并将其与各种基线和我们建议的方法进行了对比。实验结果令人鼓舞,所建议的策略似乎有助于网络社交媒体平台上的谣言识别。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Computing and Digital Systems
International Journal of Computing and Digital Systems Business, Management and Accounting-Management of Technology and Innovation
CiteScore
1.70
自引率
0.00%
发文量
111
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信