A visual framework for clustering memes in social media

Anh Dang, A. Mohammad, A. Gruzd, E. Milios, R. Minghim
{"title":"A visual framework for clustering memes in social media","authors":"Anh Dang, A. Mohammad, A. Gruzd, E. Milios, R. Minghim","doi":"10.1145/2808797.2808830","DOIUrl":null,"url":null,"abstract":"The spread of \"rumours\" in Online Social Networks (OSNs) has grown at an alarming rate. Consequently, there is an increasing need to improve understanding of the social and technological processes behind this trend. The first step in detecting rumours is to identify and extract memes, a unit of information that can be spread from person to person in OSNs. This paper proposes four similarity scores and two novel strategies to combine those similarity scores for detecting the spread of memes in OSNs, with the end goal of helping researchers as well as members of various OSNs to study the phenomenon. The two proposed strategies include: (1) automatically computing the similarity score weighting factors for four elements of a submission and (2) allowing users to engage in the clustering process and filter out outlier submissions, modify submission class labels, or assign different similarity score weight factors for various elements of a submission using a visualization prototype. To validate our approach, we collect submissions on Reddit about five controversial topics and demonstrate that the proposed strategies outperform the baseline.","PeriodicalId":371988,"journal":{"name":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2808797.2808830","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

Abstract

The spread of "rumours" in Online Social Networks (OSNs) has grown at an alarming rate. Consequently, there is an increasing need to improve understanding of the social and technological processes behind this trend. The first step in detecting rumours is to identify and extract memes, a unit of information that can be spread from person to person in OSNs. This paper proposes four similarity scores and two novel strategies to combine those similarity scores for detecting the spread of memes in OSNs, with the end goal of helping researchers as well as members of various OSNs to study the phenomenon. The two proposed strategies include: (1) automatically computing the similarity score weighting factors for four elements of a submission and (2) allowing users to engage in the clustering process and filter out outlier submissions, modify submission class labels, or assign different similarity score weight factors for various elements of a submission using a visualization prototype. To validate our approach, we collect submissions on Reddit about five controversial topics and demonstrate that the proposed strategies outperform the baseline.
社交媒体中聚类模因的视觉框架
“谣言”在在线社交网络(OSNs)上的传播以惊人的速度增长。因此,越来越需要增进对这一趋势背后的社会和技术进程的了解。检测谣言的第一步是识别和提取模因,模因是一种可以在社交网络中人与人之间传播的信息单位。本文提出了四种相似度评分和两种新颖的策略来结合这些相似度评分来检测模因在osn中的传播,最终目的是帮助研究人员以及各osn的成员研究这一现象。提出的两种策略包括:(1)自动计算提交的四个元素的相似度评分权重因子;(2)允许用户参与聚类过程,过滤掉异常提交,修改提交类标签,或使用可视化原型为提交的不同元素分配不同的相似度评分权重因子。为了验证我们的方法,我们收集了Reddit上关于五个有争议话题的提交,并证明了所提出的策略优于基线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信