paper-with-me

홈 › Papers

Learning Stance Embeddings from Signed Social Graphs

2022-01-27 · John Pougué-Biyong, Akshay Gupta, Aria Haghighi, Ahmed El-Kishky

A key challenge in social network analysis is understanding the position, or stance, of people in the graph on a large set of topics. While past work has modeled (dis)agreement in social networks using signed graphs, these approaches have not modeled agreement patterns across a range of correlated topics. For instance, disagreement on one topic may make disagreement(or agreement) more likely for related topics. We propose the Stance Embeddings Model(SEM), which jointly learns embeddings for each user and topic in signed social graphs with distinct edge types for each topic. By jointly learning user and topic embeddings, SEM is able to perform cold-start topic stance detection, predicting the stance of a user on topics for which we have not observed their engagement. We demonstrate the effectiveness of SEM using two large-scale Twitter signed graph datasets we open-source. One dataset, TwitterSG, labels (dis)agreements using engagements between users via tweets to derive topic-informed, signed edges. The other, BirdwatchSG, leverages community reports on misinformation and misleading content. On TwitterSG and BirdwatchSG, SEM shows a 39% and 26% error reduction respectively against strong baselines.

📄 PDF Abstract BibTeX arXiv:2201.11675

Code (1)

lejohnyjohn/learning-stance-embeddings-from-signed-social-graphs 공식 구현

Tasks

MisinformationStance Detection

Similar Papers 제목 키워드 기반

Signed graphs in data sciences via communicability geometry

2024-03-12 · Fernando Diaz-Diaz, Ernesto Estrada

Signed graphs are an emergent way of representing data in a variety of contexts where antagonistic interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of co…

Dimensionality Reduction

Shortest path distance approximation using deep learning techniques

2020-02-12 · Fatemeh Salehi Rizi, Joerg Schloetterer, Michael Granitzer

Computing shortest path distances between nodes lies at the heart of many graph algorithms and applications. Traditional exact methods such as breadth-first-search (BFS) do not scale up to contemporary, rapidly evolving …

Deep Learning

Multi-Modal Bayesian Embeddings for Learning Social Knowledge Graphs

2015-08-04 · Zhilin Yang, Jie Tang, William Cohen

We study the extent to which online social networks can be connected to open knowledge bases. The problem is referred to as learning social knowledge graphs. We propose a multi-modal Bayesian embedding model, GenVector, …

Knowledge Graphs

Local Distance-Preserving Node Embeddings and Their Performance on Random Graphs

2025-04-11 · My Le, Luana Ruiz, Souvik Dhara

Learning node representations is a fundamental problem in graph machine learning. While existing embedding methods effectively preserve local similarity measures, they often fail to capture global functions like graph di…

Graph Representation LearningRepresentation Learning

Heterogeneous Edge Embeddings for Friend Recommendation

2019-02-07 · Janu Verma, Srishti Gupta, Debdoot Mukherjee, Tanmoy Chakraborty

We propose a friend recommendation system (an application of link prediction) using edge embeddings on social networks. Most real-world social networks are multi-graphs, where different kinds of relationships (e.g. chat,…

Link PredictionNetwork Embedding