Post-hoc evaluation of nodes influence in information cascades: the case of coordinated accounts

• URL: http://arxiv.org/abs/2401.01684v1
• Date: Wed, 3 Jan 2024 11:40:46 GMT
• Title: Post-hoc evaluation of nodes influence in information cascades: the case of coordinated accounts
• Authors: Niccol\`o Di Marco, Sara Brunetti, Matteo Cinelli, Walter Quattrociocchi
• Abstract summary: Coordinated Inhautentic Behaviour (CIB) has emerged as a tactic to exploit the online discourse. We quantify the efficacy of CIB tactics by defining a general framework for evaluating the influence of a subset of nodes in a directed tree. We design two algorithms that provide optimal and greedy post-hoc placement strategies that lead to maximising the configuration influence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: In the last years, social media has gained an unprecedented amount of attention, playing a pivotal role in shaping the contemporary landscape of communication and connection. However, Coordinated Inhautentic Behaviour (CIB), defined as orchestrated efforts by entities to deceive or mislead users about their identity and intentions, has emerged as a tactic to exploit the online discourse. In this study, we quantify the efficacy of CIB tactics by defining a general framework for evaluating the influence of a subset of nodes in a directed tree. We design two algorithms that provide optimal and greedy post-hoc placement strategies that lead to maximising the configuration influence. We then consider cascades from information spreading on Twitter to compare the observed behaviour with our algorithms. The results show that, according to our model, coordinated accounts are quite inefficient in terms of their network influence, thus suggesting that they may play a less pivotal role than expected. Moreover, the causes of these poor results may be found in two separate aspects: a bad placement strategy and a scarcity of resources.

Related papers

• Estimating Peer Direct and Indirect Effects in Observational Network Data [16.006409149421515]
  We propose a general setting which considers both peer direct effects and peer indirect effects, and the effect of an individual's own treatment. We use attention mechanisms to distinguish the influences of different neighbors and explore high-order neighbor effects through graph neural networks. Our theoretical findings have the potential to improve intervention strategies in networked systems, with applications in areas such as social networks and epidemiology.
  arXiv  Detail & Related papers  (2024-08-21T10:02:05Z)
• Effective Off-Policy Evaluation and Learning in Contextual Combinatorial Bandits [15.916834591090009]
  We explore off-policy evaluation and learning in contextual bandits. This setting is widespread in fields such as recommender systems and healthcare. We introduce a concept of factored action space, which allows us to decompose each subset into binary indicators.
  arXiv  Detail & Related papers  (2024-08-20T21:25:04Z)
• Influence Maximization via Graph Neural Bandits [54.45552721334886]
  We set the IM problem in a multi-round diffusion campaign, aiming to maximize the number of distinct users that are influenced. We propose the framework IM-GNB (Influence Maximization with Graph Neural Bandits), where we provide an estimate of the users' probabilities of being influenced.
  arXiv  Detail & Related papers  (2024-06-18T17:54:33Z)
• Bayesian Off-Policy Evaluation and Learning for Large Action Spaces [14.203316003782604]
  In interactive systems, actions are often correlated, presenting an opportunity for more sample-efficient off-policy evaluation and learning. We introduce a unified Bayesian framework to capture these correlations through structured and informative priors. We propose sDM, a generic Bayesian approach for OPE and OPL, grounded in both algorithmic and theoretical foundations.
  arXiv  Detail & Related papers  (2024-02-22T16:09:45Z)
• Anchoring Path for Inductive Relation Prediction in Knowledge Graphs [69.81600732388182]
  APST takes both APs and CPs as the inputs of a unified Sentence Transformer architecture. We evaluate APST on three public datasets and achieve state-of-the-art (SOTA) performance in 30 of 36 transductive, inductive, and few-shot experimental settings.
  arXiv  Detail & Related papers  (2023-12-21T06:02:25Z)
• Ranking-based Group Identification via Factorized Attention on Social Tripartite Graph [68.08590487960475]
  We propose a novel GNN-based framework named Contextualized Factorized Attention for Group identification (CFAG) We devise tripartite graph convolution layers to aggregate information from different types of neighborhoods among users, groups, and items. To cope with the data sparsity issue, we devise a novel propagation augmentation layer, which is based on our proposed factorized attention mechanism.
  arXiv  Detail & Related papers  (2022-11-02T01:42:20Z)
• Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing [67.83086131278904]
  Topology-imbalance is a graph-specific imbalance problem caused by the uneven topology positions of labeled nodes. We propose a novel position-aware graph structure learning framework named PASTEL. Our key insight is to enhance the connectivity of nodes within the same class for more supervision information.
  arXiv  Detail & Related papers  (2022-08-17T14:04:21Z)
• Interpolation-based Correlation Reduction Network for Semi-Supervised Graph Learning [49.94816548023729]
  We propose a novel graph contrastive learning method, termed Interpolation-based Correlation Reduction Network (ICRN) In our method, we improve the discriminative capability of the latent feature by enlarging the margin of decision boundaries. By combining the two settings, we extract rich supervision information from both the abundant unlabeled nodes and the rare yet valuable labeled nodes for discnative representation learning.
  arXiv  Detail & Related papers  (2022-06-06T14:26:34Z)
• Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
  In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions. For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions. The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
  arXiv  Detail & Related papers  (2022-05-13T21:09:41Z)
• VigDet: Knowledge Informed Neural Temporal Point Process for Coordination Detection on Social Media [8.181808709549227]
  coordinated accounts on social media are used by misinformation campaigns to influence public opinion and manipulate social outcomes. We propose a coordination detection framework incorporating neural temporal point process with prior knowledge such as temporal logic or pre-defined filtering functions. Experimental results on a real-world dataset show the effectiveness of our proposed method compared to the SOTA model in both unsupervised and semi-supervised settings.
  arXiv  Detail & Related papers  (2021-10-28T22:19:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.