Social Science Guided Feature Engineering: A Novel Approach to Signed Link Analysis

• URL: http://arxiv.org/abs/2001.01015v1
• Date: Sat, 4 Jan 2020 00:26:05 GMT
• Title: Social Science Guided Feature Engineering: A Novel Approach to Signed Link Analysis
• Authors: Ghazaleh Beigi, Jiliang Tang, Huan Liu
• Abstract summary: Most existing work on link analysis focuses on unsigned social networks. The existence of negative links piques research interests in investigating whether properties and principles of signed networks differ from those of unsigned networks. Recent findings suggest that properties of signed networks substantially differ from those of unsigned networks.
• Score: 58.892336054718825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Many real-world relations can be represented by signed networks with positive links (e.g., friendships and trust) and negative links (e.g., foes and distrust). Link prediction helps advance tasks in social network analysis such as recommendation systems. Most existing work on link analysis focuses on unsigned social networks. The existence of negative links piques research interests in investigating whether properties and principles of signed networks differ from those of unsigned networks, and mandates dedicated efforts on link analysis for signed social networks. Recent findings suggest that properties of signed networks substantially differ from those of unsigned networks and negative links can be of significant help in signed link analysis in complementary ways. In this article, we center our discussion on a challenging problem of signed link analysis. Signed link analysis faces the problem of data sparsity, i.e. only a small percentage of signed links are given. This problem can even get worse when negative links are much sparser than positive ones as users are inclined more towards positive disposition rather than negative. We investigate how we can take advantage of other sources of information for signed link analysis. This research is mainly guided by three social science theories, Emotional Information, Diffusion of Innovations, and Individual Personality. Guided by these, we extract three categories of related features and leverage them for signed link analysis. Experiments show the significance of the features gleaned from social theories for signed link prediction and addressing the data sparsity challenge.

Related papers

• ManiTweet: A New Benchmark for Identifying Manipulation of News on Social Media [74.93847489218008]
  We present a novel task, identifying manipulation of news on social media, which aims to detect manipulation in social media posts and identify manipulated or inserted information. To study this task, we have proposed a data collection schema and curated a dataset called ManiTweet, consisting of 3.6K pairs of tweets and corresponding articles. Our analysis demonstrates that this task is highly challenging, with large language models (LLMs) yielding unsatisfactory performance.
  arXiv  Detail & Related papers  (2023-05-23T16:40:07Z)
• Rumor Detection with Self-supervised Learning on Texts and Social Graph [101.94546286960642]
  We propose contrastive self-supervised learning on heterogeneous information sources, so as to reveal their relations and characterize rumors better. We term this framework as Self-supervised Rumor Detection (SRD) Extensive experiments on three real-world datasets validate the effectiveness of SRD for automatic rumor detection on social media.
  arXiv  Detail & Related papers  (2022-04-19T12:10:03Z)
• Analyzing Wikipedia Membership Dataset and PredictingUnconnected Nodes in the Signed Networks [0.666659730119789]
  We examine how relationships can be predicted between two unconnected people in a social network by using area under Precison-Recall curve and ROC. Modeling the social network as a signed graph, we compare Triadic model,Latent Information model and Sentiment model and use them to predict peer to peer interactions.
  arXiv  Detail & Related papers  (2021-10-18T09:03:18Z)
• POLE: Polarized Embedding for Signed Networks [2.6546685109604304]
  Recent advances in machine learning for signed networks hold the promise to guide small interventions with the goal of reducing polarization in social media. Existing models are especially ineffective in predicting conflicts (or negative links) among users. This is due to a strong correlation between link signs and the network structure. We propose POLE, a signed embedding method for polarized graphs that captures both topological and signed similarities jointly.
  arXiv  Detail & Related papers  (2021-10-17T19:28:47Z)
• 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)
• Adversarial Robustness of Probabilistic Network Embedding for Link Prediction [24.335469995826244]
  We study adversarial robustness of Conditional Network Embedding (CNE) for link prediction. We measure the sensitivity of the link predictions of the model to small adversarial perturbations of the network. Our approach allows one to identify the links and non-links in the network that are most vulnerable to such perturbations.
  arXiv  Detail & Related papers  (2021-07-05T11:07:35Z)
• NetReAct: Interactive Learning for Network Summarization [60.18513812680714]
  We present NetReAct, a novel interactive network summarization algorithm which supports the visualization of networks induced by text corpora to perform sensemaking. We show how NetReAct is successful in generating high-quality summaries and visualizations that reveal hidden patterns better than other non-trivial baselines.
  arXiv  Detail & Related papers  (2020-12-22T03:56:26Z)
• Interpretable Signed Link Prediction with Signed Infomax Hyperbolic Graph [54.03786611989613]
  signed link prediction in social networks aims to reveal the underlying relationships (i.e. links) among users (i.e. nodes) We develop a unified framework, termed as Signed Infomax Hyperbolic Graph (textbfSIHG) In order to model high-order user relations and complex hierarchies, the node embeddings are projected and measured in a hyperbolic space with a lower distortion.
  arXiv  Detail & Related papers  (2020-11-25T05:09:03Z)
• Learning to Extrapolate Knowledge: Transductive Few-shot Out-of-Graph Link Prediction [69.1473775184952]
  We introduce a realistic problem of few-shot out-of-graph link prediction. We tackle this problem with a novel transductive meta-learning framework. We validate our model on multiple benchmark datasets for knowledge graph completion and drug-drug interaction prediction.
  arXiv  Detail & Related papers  (2020-06-11T17:42:46Z)

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.