Implementing Fact-Checking in Journalistic Articles Shared on Social Media in the Philippines Using Knowledge Graphs

Donata D. Acula, Louise Aster C. Oblan, Tracy B. Pedroso, Katrine Jee V. Riosa, Michelle Arianne R. Tolibas
{"title":"Implementing Fact-Checking in Journalistic Articles Shared on Social Media in the Philippines Using Knowledge Graphs","authors":"Donata D. Acula, Louise Aster C. Oblan, Tracy B. Pedroso, Katrine Jee V. Riosa, Michelle Arianne R. Tolibas","doi":"10.1109/CCOMS.2018.8463282","DOIUrl":null,"url":null,"abstract":"In the technology age, articles with fraudulent content are rampant, especially articles shared on social media. Misinformation could just be an inaccuracy at its best, or it could lead to normalizing false information at worst. To aid the predicament, the researchers created a system that will “fact check” suspicious articles against those articles that have been deemed credible, reliable, and more accurate, in order to help fight deceiving content that may be detrimental to society. The journal regarding computational fact checking that was published by Ciampaglia, et. al. (2015) from the Indiana University in the USA entitled Computational Fact Checking from Knowledge Networks, was used as the basis and inspiration for this thesis. The researchers made use of the undirected graph (UG) together with a part-of-speech (POS) tagging algorithm to create a knowledge graph (KG) that would serve as the center of the system. Five different POS tagging algorithms were paired with the UG to assess which combination would yield the best results, these are Conditional Random Fields, Logistic Regression, a Hybrid of CRF and LR, Random Forests, and K-Nearest Neighbors. Random Forests and K-Nearest Neighbors were classification algorithms used in Ciampaglia's study. It was concluded that among the 5 pairs of UG and POS Tagging algorithms, the Hybrid of CRF and LR used as a POS tagger, together with the UG, created the most efficient KG.","PeriodicalId":405664,"journal":{"name":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 3rd International Conference on Computer and Communication Systems (ICCCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCOMS.2018.8463282","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In the technology age, articles with fraudulent content are rampant, especially articles shared on social media. Misinformation could just be an inaccuracy at its best, or it could lead to normalizing false information at worst. To aid the predicament, the researchers created a system that will “fact check” suspicious articles against those articles that have been deemed credible, reliable, and more accurate, in order to help fight deceiving content that may be detrimental to society. The journal regarding computational fact checking that was published by Ciampaglia, et. al. (2015) from the Indiana University in the USA entitled Computational Fact Checking from Knowledge Networks, was used as the basis and inspiration for this thesis. The researchers made use of the undirected graph (UG) together with a part-of-speech (POS) tagging algorithm to create a knowledge graph (KG) that would serve as the center of the system. Five different POS tagging algorithms were paired with the UG to assess which combination would yield the best results, these are Conditional Random Fields, Logistic Regression, a Hybrid of CRF and LR, Random Forests, and K-Nearest Neighbors. Random Forests and K-Nearest Neighbors were classification algorithms used in Ciampaglia's study. It was concluded that among the 5 pairs of UG and POS Tagging algorithms, the Hybrid of CRF and LR used as a POS tagger, together with the UG, created the most efficient KG.
利用知识图谱对菲律宾社交媒体上分享的新闻文章进行事实核查
在科技时代,含有欺诈内容的文章十分猖獗,尤其是在社交媒体上分享的文章。错误信息在最好的情况下可能只是不准确,或者在最坏的情况下可能导致错误信息正常化。为了解决这一困境,研究人员创建了一个系统,将可疑文章与那些被认为可信、可靠和更准确的文章进行“事实核查”,以帮助打击可能对社会有害的欺骗性内容。美国印第安纳大学的Ciampaglia等人(2015年)发表的关于计算事实检查的期刊《来自知识网络的计算事实检查》被用作本论文的基础和灵感。研究人员利用无向图(UG)和词性标注算法创建了一个知识图(KG),该知识图将作为系统的中心。五种不同的POS标注算法与UG配对,以评估哪种组合会产生最好的结果,这些是条件随机场,逻辑回归,CRF和LR的混合,随机森林和k近邻。随机森林和k近邻是Ciampaglia研究中使用的分类算法。结果表明,在5对UG和POS标注算法中,使用CRF和LR的混合算法作为POS标注器,与UG一起产生最有效的KG。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信