Verified authors shape X/Twitter discursive communities

• URL: http://arxiv.org/abs/2405.04896v1
• Date: Wed, 8 May 2024 09:04:46 GMT
• Title: Verified authors shape X/Twitter discursive communities
• Authors: Stefano Guarino, Ayoub Mounim, Guido Caldarelli, Fabio Saracco,
• Abstract summary: We show that the core of ideological/discursive communities on X/Twitter can be effectively identified by uncovering the most informative interactions. The analysis is performed considering three X/Twitter datasets related to the main political events of 2022 in Italy.
• Score: 0.24999074238880484
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Community detection algorithms try to extract a mesoscale structure from the available network data, generally avoiding any explicit assumption regarding the quantity and quality of information conveyed by specific sets of edges. In this paper, we show that the core of ideological/discursive communities on X/Twitter can be effectively identified by uncovering the most informative interactions in an authors-audience bipartite network through a maximum-entropy null model. The analysis is performed considering three X/Twitter datasets related to the main political events of 2022 in Italy, using as benchmarks four state-of-the-art algorithms - three descriptive, one inferential -, and manually annotating nearly 300 verified users based on their political affiliation. In terms of information content, the communities obtained with the entropy-based algorithm are comparable to those obtained with some of the benchmarks. However, such a methodology on the authors-audience bipartite network: uses just a small sample of the available data to identify the central users of each community; returns a neater partition of the user set in just a few, easy to interpret, communities; clusters well-known political figures in a way that better matches the political alliances when compared with the benchmarks. Our results provide an important insight into online debates, highlighting that online interaction networks are mostly shaped by the activity of a small set of users who enjoy public visibility even outside social media.

Related papers

• Political Leaning Inference through Plurinational Scenarios [4.899818550820576]
  This work focuses on three diverse regions in Spain (Basque Country, Catalonia and Galicia) to explore various methods for multi-party categorization. We use a two-step method involving unsupervised user representations obtained from the retweets and their subsequent use for political leaning detection.
  arXiv  Detail & Related papers  (2024-06-12T07:42:12Z)
• Detecting Political Opinions in Tweets through Bipartite Graph Analysis: A Skip Aggregation Graph Convolution Approach [9.350629400940493]
  We focus on the 2020 US presidential election and create a large-scale dataset from Twitter. To detect political opinions in tweets, we build a user-tweet bipartite graph based on users' posting and retweeting behaviors. We introduce a novel skip aggregation mechanism that makes tweet nodes aggregate information from second-order neighbors.
  arXiv  Detail & Related papers  (2023-04-22T10:38:35Z)
• Fairness meets Cross-Domain Learning: a new perspective on Models and Metrics [80.07271410743806]
  We study the relationship between cross-domain learning (CD) and model fairness. We introduce a benchmark on face and medical images spanning several demographic groups as well as classification and localization tasks. Our study covers 14 CD approaches alongside three state-of-the-art fairness algorithms and shows how the former can outperform the latter.
  arXiv  Detail & Related papers  (2023-03-25T09:34:05Z)
• Panning for gold: Lessons learned from the platform-agnostic automated detection of political content in textual data [48.7576911714538]
  We discuss how these techniques can be used to detect political content across different platforms. We compare the performance of three groups of detection techniques relying on dictionaries, supervised machine learning, or neural networks. Our results show the limited impact of preprocessing on model performance, with the best results for less noisy data being achieved by neural network- and machine-learning-based models.
  arXiv  Detail & Related papers  (2022-07-01T15:23:23Z)
• Twitter Referral Behaviours on News Consumption with Ensemble Clustering of Click-Stream Data in Turkish Media [2.9005223064604078]
  This study investigates the readers' click activities in the organizations' websites to identify news consumption patterns following referrals from Twitter. The investigation is widened to a broad perspective by linking the log data with news content to enrich the insights.
  arXiv  Detail & Related papers  (2022-02-04T09:57:13Z)
• Improved Topic modeling in Twitter through Community Pooling [0.0]
  Twitter posts are short and often less coherent than other text documents. We propose a new pooling scheme for topic modeling in Twitter, which groups tweets whose authors belong to the same community. Results show that our Community polling method outperformed other methods on the majority of metrics in two heterogeneous datasets.
  arXiv  Detail & Related papers  (2021-12-20T17:05:32Z)
• Author Clustering and Topic Estimation for Short Texts [69.54017251622211]
  We propose a novel model that expands on the Latent Dirichlet Allocation by modeling strong dependence among the words in the same document. We also simultaneously cluster users, removing the need for post-hoc cluster estimation. Our method performs as well as -- or better -- than traditional approaches to problems arising in short text.
  arXiv  Detail & Related papers  (2021-06-15T20:55:55Z)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• CommuNety: A Deep Learning System for the Prediction of Cohesive Social Communities [14.839117147209603]
  We propose CommuNety, a deep learning system for the prediction of cohesive social networks using images. The proposed deep learning model consists of hierarchical CNN architecture to learn descriptive features related to each cohesive network. The paper also proposes a novel Face Co-occurrence Frequency algorithm to quantify existence of people in images, and a novel photo ranking method to analyze the strength of relationship between different individuals in a predicted social network.
  arXiv  Detail & Related papers  (2020-07-29T11:03:22Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36:24Z)
• NWPU-Crowd: A Large-Scale Benchmark for Crowd Counting and Localization [101.13851473792334]
  We construct a large-scale congested crowd counting and localization dataset, NWPU-Crowd, consisting of 5,109 images, in a total of 2,133,375 annotated heads with points and boxes. Compared with other real-world datasets, it contains various illumination scenes and has the largest density range (020,033) We describe the data characteristics, evaluate the performance of some mainstream state-of-the-art (SOTA) methods, and analyze the new problems that arise on the new data.
  arXiv  Detail & Related papers  (2020-01-10T09:26:04Z)

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.