arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.00599cs.SIcs.LG
收藏

用于分类协调运动与有机推特趋势的大规模参与网络

Large Engagement Networks for Classifying Coordinated Campaigns and Organic Twitter Trends

University at Buffalo(布法罗大学);University of Edinburgh(爱丁堡大学)

Atul Anand Gopalakrishnan, Jakir Hossain, Tugrulcan Elmas, Ahmet Erdem Sariyuce

AI总结:

本文构建大规模参与网络数据集LEN,用于区分协调运动与有机推特趋势,并验证现有GNN方法在该任务上表现平庸,为图分类提供新挑战。

摘要:

社交媒体用户和非真实账户(如机器人)可能会协调一致地推广其话题。此类话题可能给人留下在公众中自然流行的印象,尽管它们实际上是集中管理的“草根”式虚假宣传运动。由于缺乏可靠的基准真值,预测一个话题是自然流行还是协调运动具有挑战性。在本文中,我们通过检测由短暂性虚假宣传攻击推动的运动来创建这样的基准真值。这些攻击通过使用机器人在短时间内以协调方式发推,然后立即删除其推文,将任何话题推至推特(X)的趋势列表。我们手动整理了一个有机推特趋势的数据集。然后,我们基于这些数据集构建参与网络,这些网络可作为图分类任务的挑战性测试平台,以区分协调运动与有机趋势。参与网络以用户为节点,以用户之间的参与行为(转推、回复和引用)为边。我们发布了179个运动样本和135个非运动样本的参与网络,并提供了更细粒度的标签以刻画运动和非运动的类型。我们的数据集LEN(大规模参与网络)可在以下网址获取。与传统的图分类数据集(通常最多包含几十个节点和几百条边)相比,LEN中的图规模更大。LEN中的平均图约有1.1万个节点和2.3万条边。我们表明,最先进的图神经网络(GNN)方法在LEN上进行运动与非运动分类以及运动类型分类时仅取得平庸的结果。LEN为图分类问题提供了一个独特且具有挑战性的试验场。我们相信,LEN将有助于推动大规模网络上图分类技术的前沿发展,并为区分协调运动与有机趋势提供一个有趣的应用场景。

英文摘要:

Social media users and inauthentic accounts, such as bots, may coordinate in promoting their topics. Such topics may give the impression that they are organically popular among the public, even though they are astroturfing campaigns that are centrally managed. It is challenging to predict if a topic is organic or a coordinated campaign due to the lack of reliable ground truth. In this paper, we create such ground truth by detecting the campaigns promoted by ephemeral astroturfing attacks. These attacks push any topic to Twitter's (X) trends list by employing bots that tweet in a coordinated manner in a short period and then immediately delete their tweets. We manually curate a dataset of organic Twitter trends. We then create engagement networks out of these datasets which can serve as a challenging testbed for graph classification task to distinguish between campaigns and organic trends. Engagement networks consist of users as nodes and engagements as edges (retweets, replies, and quotes) between users. We release the engagement networks for 179 campaigns and 135 non-campaigns, and also provide finer-grain labels to characterize the type of the campaigns and non-campaigns. Our dataset, LEN (Large Engagement Networks), is available in the URL below. In comparison to traditional graph classification datasets, which are small with tens of nodes and hundreds of edges at most, graphs in LEN are larger. The average graph in LEN has ~11K nodes and ~23K edges. We show that state-of-the-art GNN methods give only mediocre results for campaign vs. non-campaign and campaign type classification on LEN. LEN offers a unique and challenging playfield for the graph classification problem. We believe that LEN will help advance the frontiers of graph classification techniques on large networks and also provide an interesting use case in terms of distinguishing coordinated campaigns and organic trends.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑