Unsupervised User Stance Detection on Twitter
April 03, 2019 Β· Declared Dead Β· π International Conference on Web and Social Media
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Kareem Darwish, Peter Stefanov, MichaΓ«l Aupetit, Preslav Nakov
arXiv ID
1904.02000
Category
cs.SI: Social & Info Networks
Citations
176
Venue
International Conference on Web and Social Media
Last Checked
4 months ago
Abstract
We present a highly effective unsupervised framework for detecting the stance of prolific Twitter users with respect to controversial topics. In particular, we use dimensionality reduction to project users onto a low-dimensional space, followed by clustering, which allows us to find core users that are representative of the different stances. Our framework has three major advantages over pre-existing methods, which are based on supervised or semi-supervised classification. First, we do not require any prior labeling of users: instead, we create clusters, which are much easier to label manually afterwards, e.g., in a matter of seconds or minutes instead of hours. Second, there is no need for domain- or topic-level knowledge either to specify the relevant stances (labels) or to conduct the actual labeling. Third, our framework is robust in the face of data skewness, e.g., when some users or some stances have greater representation in the data. We experiment with different combinations of user similarity features, dataset sizes, dimensionality reduction methods, and clustering algorithms to ascertain the most effective and most computationally efficient combinations across three different datasets (in English and Turkish). We further verified our results on additional tweet sets covering six different controversial topics. Our best combination in terms of effectiveness and efficiency uses retweeted accounts as features, UMAP for dimensionality reduction, and Mean Shift for clustering, and yields a small number of high-quality user clusters, typically just 2--3, with more than 98\% purity. The resulting user clusters can be used to train downstream classifiers. Moreover, our framework is robust to variations in the hyper-parameter values and also with respect to random initialization.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Social & Info Networks
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Fake News Detection on Social Media: A Data Mining Perspective
R.I.P.
π»
Ghosted
Natural Scales in Geographical Patterns
R.I.P.
π»
Ghosted
Representation Learning on Graphs: Methods and Applications
R.I.P.
π»
Ghosted
The COVID-19 Social Media Infodemic
R.I.P.
π»
Ghosted
OSMnx: New Methods for Acquiring, Constructing, Analyzing, and Visualizing Complex Street Networks
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted