Graph Enhanced Representation Learning for News Recommendation
- URL: http://arxiv.org/abs/2003.14292v1
- Date: Tue, 31 Mar 2020 15:27:31 GMT
- Title: Graph Enhanced Representation Learning for News Recommendation
- Authors: Suyu Ge and Chuhan Wu and Fangzhao Wu and Tao Qi and Yongfeng Huang
- Abstract summary: We propose a news recommendation method which can enhance the representation learning of users and news.
In our method, users and news are both viewed as nodes in a bipartite graph constructed from historical user click behaviors.
- Score: 85.3295446374509
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: With the explosion of online news, personalized news recommendation becomes
increasingly important for online news platforms to help their users find
interesting information. Existing news recommendation methods achieve
personalization by building accurate news representations from news content and
user representations from their direct interactions with news (e.g., click),
while ignoring the high-order relatedness between users and news. Here we
propose a news recommendation method which can enhance the representation
learning of users and news by modeling their relatedness in a graph setting. In
our method, users and news are both viewed as nodes in a bipartite graph
constructed from historical user click behaviors. For news representations, a
transformer architecture is first exploited to build news semantic
representations. Then we combine it with the information from neighbor news in
the graph via a graph attention network. For user representations, we not only
represent users from their historically clicked news, but also attentively
incorporate the representations of their neighbor users in the graph. Improved
performances on a large-scale real-world dataset validate the effectiveness of
our proposed method.
Related papers
- GLoCIM: Global-view Long Chain Interest Modeling for news recommendation [59.3925442282951]
Accurately recommending candidate news articles to users has always been the core challenge of news recommendation system.
Recent efforts have primarily focused on extracting local subgraph information in a global click graph constructed by the clicked news sequence of all users.
We propose a Global-view Long Chain Interests Modeling for news recommendation (GLoCIM), which combines neighbor interest with long chain interest distilled from a global click graph.
arXiv Detail & Related papers (2024-08-01T18:17:25Z) - Going Beyond Local: Global Graph-Enhanced Personalized News
Recommendations [12.783388192026855]
We propose a novel model called GLORY (Global-LOcal news Recommendation sYstem), which combines global representations learned from other users with local representations to enhance personalized recommendation systems.
We accomplish this by constructing a Global-aware Historical News, which includes a global news graph and employs gated graph neural networks to enrich news representations.
We extend this approach to a Global Candidate News, utilizing a global entity graph and a candidate news aggregator to enhance candidate news representation.
arXiv Detail & Related papers (2023-07-13T06:25:22Z) - Nothing Stands Alone: Relational Fake News Detection with Hypergraph
Neural Networks [49.29141811578359]
We propose to leverage a hypergraph to represent group-wise interaction among news, while focusing on important news relations with its dual-level attention mechanism.
Our approach yields remarkable performance and maintains the high performance even with a small subset of labeled news data.
arXiv Detail & Related papers (2022-12-24T00:19:32Z) - Mining User-aware Multi-Relations for Fake News Detection in Large Scale
Online Social Networks [25.369320307526362]
credible users are more likely to share trustworthy news, while untrusted users have a higher probability of spreading untrustworthy news.
We construct a dual-layer graph to extract multiple relations of news and users in social networks to derive rich information for detecting fake news.
We propose a fake news detection model named Us-DeFake, which learns the propagation features of news in the news layer and the interaction features of users in the user layer.
arXiv Detail & Related papers (2022-12-21T05:30:35Z) - DIGAT: Modeling News Recommendation with Dual-Graph Interaction [23.31021910348558]
News recommendation (NR) is essential for online news services.
Existing NR methods typically adopt a news-user representation learning framework, facing two potential limitations.
We propose dual-interactive graph attention networks (DIGAT) consisting of news- and user-graph channels.
arXiv Detail & Related papers (2022-10-11T07:01:40Z) - IGNiteR: News Recommendation in Microblogging Applications (Extended
Version) [3.2108350580418166]
We propose a deep-learning based approach that is diffusion and influence-aware, called Influence-Graph News Recommender (IGNiteR)
To represent the news, a multi-level attention-based encoder is used to reveal the different interests of users.
We perform extensive experiments on two real-world datasets, showing that IGNiteR outperforms the state-of-the-art deep-learning based news recommendation methods.
arXiv Detail & Related papers (2022-10-04T22:33:58Z) - Aspect-driven User Preference and News Representation Learning for News
Recommendation [9.187076140490902]
News recommender systems usually learn topic-level representations of users and news for recommendation.
We propose a novel Aspect-driven News Recommender System (ANRS) built on aspect-level user preference and news representation learning.
arXiv Detail & Related papers (2021-10-12T07:38:54Z) - Why Do We Click: Visual Impression-aware News Recommendation [108.73539346064386]
This work is inspired by the fact that users make their click decisions mostly based on the visual impression they perceive when browsing news.
We propose to capture such visual impression information with visual-semantic modeling for news recommendation.
In addition, we inspect the impression from a global view and take structural information, such as the arrangement of different fields and spatial position of different words on the impression.
arXiv Detail & Related papers (2021-09-26T16:58:14Z) - User Preference-aware Fake News Detection [61.86175081368782]
Existing fake news detection algorithms focus on mining news content for deceptive signals.
We propose a new framework, UPFD, which simultaneously captures various signals from user preferences by joint content and graph modeling.
arXiv Detail & Related papers (2021-04-25T21:19:24Z) - Causal Understanding of Fake News Dissemination on Social Media [50.4854427067898]
We argue that it is critical to understand what user attributes potentially cause users to share fake news.
In fake news dissemination, confounders can be characterized by fake news sharing behavior that inherently relates to user attributes and online activities.
We propose a principled approach to alleviating selection bias in fake news dissemination.
arXiv Detail & Related papers (2020-10-20T19:37:04Z)
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.