The use of the word "\{gamma}\u{psion}ναι\k{appa}ο\k{appa}τονια" (femicide) in Greek-speaking Twitter
Between 2019 and 2022, Greek media attention has been attracted by a rather unusually high number of femicide cases which have been trending for several weeks up to months in the public debate and one of the contributing factors is the feedback loop between traditional media and social media. In this paper we are investigating the use of the term "\{gamma}\u{psion}{\nu}{\alpha}{\iota}\k{appa}{\omicron}\k{appa}{\tau}{\omicron}{\nu}{\iota}{\alpha}" (femicide) in Greek speaking twitter. More specifically, we approach the problem from a stance detection perspective, aiming to automatically identify user position with regards to the feministic semantics of the word. We also discuss findings from an identity analysis perspective and intercorrelations with hate speech that have been identified in the collected corpus of tweets.
Code (0)
등록된 구현이 없습니다.
Tasks
PositionStance DetectionSimilar Papers 제목 키워드 기반
On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Łojasiewicz Condition
This paper considers the optimization problem of the form $\min_{{\bf x}\in{\mathbb R}^d} f({\bf x})\triangleq \frac{1}{n}\sum_{i=1}^n f_i({\bf x})$, where $f(\cdot)$ satisfies the Polyak--{\L}ojasiewicz (PL) condition w…
Sparse Convex Optimization via Adaptively Regularized Hard Thresholding
The goal of Sparse Convex Optimization is to optimize a convex function $f$ under a sparsity constraint $s\leq s^*\gamma$, where $s^*$ is the target number of non-zero entries in a feasible solution (sparsity) and $\gamm…
compressed sensingA new $\kappa$-deformed parametric model for the size distribution of wealth
It has been pointed out by Patriarca et al. (2005) that the power-law tailed equilibrium distribution in heterogeneous kinetic exchange models with a distributed saving parameter can be resolved as a mixture of Gamma dis…
Optimal algorithms for smooth and strongly convex distributed optimization in networks
In this paper, we determine the optimal convergence rates for strongly convex and smooth distributed optimization in two settings: centralized and decentralized communications over a network. For centralized (i.e. master…
Distributed OptimizationregressionA mixing time bound for Gibbs sampling from log-smooth log-concave distributions
The Gibbs sampler, also known as the coordinate hit-and-run algorithm, is a Markov chain that is widely used to draw samples from probability distributions in arbitrary dimensions. At each iteration of the algorithm, a r…