Domain-based user embedding for competing events on social media

• URL: http://arxiv.org/abs/2308.14806v2
• Date: Wed, 30 Aug 2023 07:07:05 GMT
• Title: Domain-based user embedding for competing events on social media
• Authors: Wentao Xu, Kazutoshi Sasahara
• Abstract summary: We propose a user embedding method based on the URL domain co-occurrence network, which is simple but effective for representing social media users in competing events. Our results revealed that user embeddings generated directly from the retweet network, and those based on language, performed below expectations. These findings suggest that the domain-based user embedding can serve as an effective tool to characterize social media users participating in competing events.
• Score: 4.1245904895794085
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Online social networks offer vast opportunities for computational social science, but effective user embedding is crucial for downstream tasks. Traditionally, researchers have used pre-defined network-based user features, such as degree, and centrality measures, and/or content-based features, such as posts and reposts. However, these measures may not capture the complex characteristics of social media users. In this study, we propose a user embedding method based on the URL domain co-occurrence network, which is simple but effective for representing social media users in competing events. We assessed the performance of this method in binary classification tasks using benchmark datasets that included Twitter users related to COVID-19 infodemic topics (QAnon, Biden, Ivermectin). Our results revealed that user embeddings generated directly from the retweet network, and those based on language, performed below expectations. In contrast, our domain-based embeddings outperformed these methods while reducing computation time. These findings suggest that the domain-based user embedding can serve as an effective tool to characterize social media users participating in competing events, such as political campaigns and public health crises.

Related papers

• Verified authors shape X/Twitter discursive communities [0.24999074238880484]
  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.
  arXiv  Detail & Related papers  (2024-05-08T09:04:46Z)
• SoMeR: Multi-View User Representation Learning for Social Media [1.7949335303516192]
  We propose SoMeR, a Social Media user representation learning framework that incorporates temporal activities, text content, profile information, and network interactions to learn comprehensive user portraits. SoMeR encodes user post streams as sequences of timestamped textual features, uses transformers to embed this along with profile data, and jointly trains with link prediction and contrastive learning objectives. We demonstrate SoMeR's versatility through two applications: 1) Identifying inauthentic accounts involved in coordinated influence operations by detecting users posting similar content simultaneously, and 2) Measuring increased polarization in online discussions after major events by quantifying how users with different beliefs moved farther apart
  arXiv  Detail & Related papers  (2024-05-02T22:26:55Z)
• Decoding the Silent Majority: Inducing Belief Augmented Social Graph with Large Language Model for Response Forecasting [74.68371461260946]
  SocialSense is a framework that induces a belief-centered graph on top of an existent social network, along with graph-based propagation to capture social dynamics. Our method surpasses existing state-of-the-art in experimental evaluations for both zero-shot and supervised settings.
  arXiv  Detail & Related papers  (2023-10-20T06:17:02Z)
• 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)
• Cross-Network Social User Embedding with Hybrid Differential Privacy Guarantees [81.6471440778355]
  We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way. In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types. To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
  arXiv  Detail & Related papers  (2022-09-04T06:22:37Z)
• Content Popularity Prediction in Fog-RANs: A Clustered Federated Learning Based Approach [66.31587753595291]
  We propose a novel mobility-aware popularity prediction policy, which integrates content popularities in terms of local users and mobile users. For local users, the content popularity is predicted by learning the hidden representations of local users and contents. For mobile users, the content popularity is predicted via user preference learning.
  arXiv  Detail & Related papers  (2022-06-13T03:34:00Z)
• Identification of Twitter Bots based on an Explainable ML Framework: the US 2020 Elections Case Study [72.61531092316092]
  This paper focuses on the design of a novel system for identifying Twitter bots based on labeled Twitter data. Supervised machine learning (ML) framework is adopted using an Extreme Gradient Boosting (XGBoost) algorithm. Our study also deploys Shapley Additive Explanations (SHAP) for explaining the ML model predictions.
  arXiv  Detail & Related papers  (2021-12-08T14:12:24Z)
• Harnessing the Power of Ego Network Layers for Link Prediction in Online Social Networks [0.734084539365505]
  Predictions are typically based on unsupervised or supervised learning. We argue that richer information about personal social structure of individuals might lead to better predictions. We show that social-awareness generally provides significant improvements in the prediction performance.
  arXiv  Detail & Related papers  (2021-09-19T18:49:10Z)
• SOK: Seeing and Believing: Evaluating the Trustworthiness of Twitter Users [4.609388510200741]
  Currently, there is no automated way of determining which news or users are credible and which are not. In this work, we created a model which analysed the behaviour of50,000 politicians on Twitter. We classified the political Twitter users as either trusted or untrusted using random forest, multilayer perceptron, and support vector machine.
  arXiv  Detail & Related papers  (2021-07-16T17:39:32Z)
• Locate Who You Are: Matching Geo-location to Text for Anchor Link Prediction [40.654494490237]
  We propose a novel anchor link prediction framework for matching users across networks. Our approach outperforms existing methods and achieves state-of-the-art results.
  arXiv  Detail & Related papers  (2021-04-19T08:15:28Z)
• DiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation [50.08581302050378]
  Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences. We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet) In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
  arXiv  Detail & Related papers  (2020-01-15T08:45:34Z)

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.