Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.12172

Cross-language sentiment analysis of European Twitter messages duringthe COVID-19 pandemic

Anna Kruspe·Matthias Häberle·Iona Kuhn·Xiao Xiang Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

Social media data can be a very salient source of information during crises. User-generated messages provide a window into people's minds during such times, allowing us insights about their moods and opinions. Due to the vast amounts of such messages, a large-scale analysis of population-wide developments becomes possible. In this paper, we analyze Twitter messages (tweets) collected during the first months of the COVID-19 pandemic in Europe with regard to their sentiment. This is implemented with a neural network for sentiment analysis using multilingual sentence embeddings. We separate the results by country of origin, and correlate their temporal development with events in those countries. This allows us to study the effect of the situation on people's moods. We see, for example, that lockdown announcements correlate with a deterioration of mood in almost all surveyed countries, which recovers within a short time span.

Explore related subjects

cs.SIstat.ML

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Kruspe, Matthias Häberle, Iona Kuhn, Xiao Xiang Zhu. 2020-08-27. Cross-language sentiment analysis of European Twitter messages duringthe COVID-19 pandemic. https://arxiv.org/abs/2008.12172

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Generalization and the Rise of System-level Creativity in Science

Scientific progress is widely understood as combinatorial, yet existing measures focus on the inputs a paper draws together, saying little about how knowledge is supplied for downstream reuse. Analyzing citation networks from tens of millions of publications in OpenAlex and the Web of Science, we decompose scientific contributions into three functional types, foundations, extensions, and generalizations, distinguishable by the roles they play in future science. Foundational and extensional works, which build and elaborate ideas within disciplines, dominated the post-war decades but declined steadily after the 1990s, while generalizations that catalyze innovation across many contexts rose sharply. Challenging the narrative of declining innovation inferred from the disruption index, our findings suggest the locus of innovation has shifted from within disciplines to between them, a transition the Internet and large language models may have facilitated. Our indices disentangle innovation modes conflated by existing measures, enabling reinterpretation of landmark findings of 'disruptive' science.

cs.SI↗
arXiv2026

Reproducibility Challenges in Computational Network Science: Evidence, Causes, and Recommendations

Reproducibility is essential for scientific progress, enabling validation, fair comparison, and building upon prior work. In computational network science (CNS), however, reproducibility remains limited due to missing code, inaccessible datasets, and insufficient reporting of experimental details. This paper presents a taxonomy of reproducibility in CNS, structured around artifact availability, algorithmic clarity, experimental environments, and data processing and experimental pipelines. To systematically examine these challenges, we conduct four case studies spanning diverse methodological settings: topic-based influential user detection (network science and natural language processing-based methods), influence-based community detection (pure network-based methods), influence maximization (classical, heuristic, approximation, and AI-based mixed approaches), and reinforcement learning for network analysis (learning-based methods). Across these domains, we observe a consistent lack of publicly available artifacts, particularly code and datasets, hindering verification and comparison of results. We identify key causes of this reproducibility gap, including limited incentives for sharing artifacts, data access restrictions, incomplete experimental descriptions, and a complex methodological pipeline. Finally, we outline recommendations to improve reproducibility, including mandatory artifact sharing policies, standardized benchmarks, and comprehensive reporting of experimental setups. Addressing these gaps is critical to ensure transparency, comparability, and sustained progress in computational network science.

cs.SI↗
arXiv2026

Locally Fair PageRank: Mean-Field Approximation and One-Step Refinement

Graph-based ranking methods such as PageRank can amplify structural disparities in networks, motivating fairness-aware ranking mechanisms for sensitive groups. Locally Fair PageRank (LFPR) enforces fairness through local propagation, but exact computation requires repeated iterations until convergence, limiting scalability on large graphs. We develop a scalable analytical framework for approximating Neighborhood Locally Fair PageRank and Uniform Locally Fair PageRank. By introducing a group-aware heterogeneous mean-field representation, the framework aggregates structurally similar nodes into degree classes and derives closed-form approximations of stationary LFPR scores, avoiding repeated propagation over the fairness-aware transition matrix. We develop a One-Step Refinement (ORF) mechanism that applies the fairness-aware propagation operator once to the mean-field estimate, incorporating node-specific neighborhood information without iterative convergence. The fluctuation analysis characterizes degree-dependent variability around the mean-field solution and shows that the coefficient of variation decreases with increasing in-degree. The mean-field approximation reduces the computational cost of exact LFPR from iterative graph-scale propagation to linear-time node-level estimation, while ORF requires one graph traversal. Experiments on six real-world networks show strong agreement with exact LFPR scores and rankings, preservation of group-level fairness, and substantial runtime reductions. The mean-field approximation reduces complexity to $\mathcal{O}(n)$, while ORF improves accuracy with $\mathcal{O}(m+n)$.

cs.SI↗