SiReN: Sign-Aware Recommendation Using Graph Neural Networks
- URL: http://arxiv.org/abs/2108.08735v1
- Date: Thu, 19 Aug 2021 15:07:06 GMT
- Title: SiReN: Sign-Aware Recommendation Using Graph Neural Networks
- Authors: Changwon Seo, Kyeong-Joong Jeong, Sungsu Lim, and Won-Yong Shin
- Abstract summary: We present SiReN, a new sign-aware recommender system based on GNN models.
SiReN consistently outperforms state-of-the-art NE-aided recommendation methods.
- Score: 6.739000442575012
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In recent years, many recommender systems using network embedding (NE) such
as graph neural networks (GNNs) have been extensively studied in the sense of
improving recommendation accuracy. However, such attempts have focused mostly
on utilizing only the information of positive user-item interactions with high
ratings. Thus, there is a challenge on how to make use of low rating scores for
representing users' preferences since low ratings can be still informative in
designing NE-based recommender systems. In this study, we present SiReN, a new
sign-aware recommender system based on GNN models. Specifically, SiReN has
three key components: 1) constructing a signed bipartite graph for more
precisely representing users' preferences, which is split into two
edge-disjoint graphs with positive and negative edges each, 2) generating two
embeddings for the partitioned graphs with positive and negative edges via a
GNN model and a multi-layer perceptron (MLP), respectively, and then using an
attention model to obtain the final embeddings, and 3) establishing a
sign-aware Bayesian personalized ranking (BPR) loss function in the process of
optimization. Through comprehensive experiments, we empirically demonstrate
that SiReN consistently outperforms state-of-the-art NE-aided recommendation
methods.
Related papers
- DFGNN: Dual-frequency Graph Neural Network for Sign-aware Feedback [51.72177873832969]
We propose a novel model that models positive and negative feedback from a frequency filter perspective.
We conduct extensive experiments on real-world datasets and demonstrate the effectiveness of the proposed model.
arXiv Detail & Related papers (2024-05-24T07:07:41Z) - Improving Matrix Completion by Exploiting Rating Ordinality in Graph
Neural Networks [15.288361490454276]
Matrix completion is an important area of research in recommender systems.
Recent methods view a rating matrix as a user-item bi-partite graph with labeled edges denoting observed ratings.
We introduce a new method, called ROGMC, to leverage Rating Ordinality in GNN-based Matrix Completion.
arXiv Detail & Related papers (2024-03-07T14:04:33Z) - Efficient Link Prediction via GNN Layers Induced by Negative Sampling [92.05291395292537]
Graph neural networks (GNNs) for link prediction can loosely be divided into two broad categories.
First, emphnode-wise architectures pre-compute individual embeddings for each node that are later combined by a simple decoder to make predictions.
Second, emphedge-wise methods rely on the formation of edge-specific subgraph embeddings to enrich the representation of pair-wise relationships.
arXiv Detail & Related papers (2023-10-14T07:02:54Z) - Dual Policy Learning for Aggregation Optimization in Graph Neural
Network-based Recommender Systems [4.026354668375411]
We propose a novel reinforcement learning-based message passing framework for recommender systems.
This framework adaptively determines high-order connectivity to aggregate users and items using dual policy learning.
Our results show that our proposed framework significantly enhances the recent base model, improving nDCG and Recall by up to 63.7% and 42.9%, respectively.
arXiv Detail & Related papers (2023-02-21T09:47:27Z) - Graph Trend Networks for Recommendations [34.06649831739749]
The key of recommender systems is to predict how likely users will interact with items based on their historical online behaviors.
To exploit these user-item interactions, there are increasing efforts on considering the user-item interactions as a user-item bipartite graph.
Despite their success, most existing GNN-based recommender systems overlook the existence of interactions caused by unreliable behaviors.
We propose the Graph Trend Networks for recommendations (GTN) with principled designs that can capture the adaptive reliability of the interactions.
arXiv Detail & Related papers (2021-08-12T06:09:18Z) - Self-supervised Graph Learning for Recommendation [69.98671289138694]
We explore self-supervised learning on user-item graph for recommendation.
An auxiliary self-supervised task reinforces node representation learning via self-discrimination.
Empirical studies on three benchmark datasets demonstrate the effectiveness of SGL.
arXiv Detail & Related papers (2020-10-21T06:35:26Z) - CatGCN: Graph Convolutional Networks with Categorical Node Features [99.555850712725]
CatGCN is tailored for graph learning when the node features are categorical.
We train CatGCN in an end-to-end fashion and demonstrate it on semi-supervised node classification.
arXiv Detail & Related papers (2020-09-11T09:25:17Z) - Embedding Ranking-Oriented Recommender System Graphs [10.74267520911262]
We propose PGRec, a graph-based ranking-oriented recommendation framework.
We have evaluated the performance of the proposed method against the state of the art model-based and neighborhood-based recommendation methods, and our experiments show that PGRec outperforms the baseline algorithms up to 3.2% in terms of NDCG@10 in different MovieLens datasets.
arXiv Detail & Related papers (2020-07-31T16:56:54Z) - Binarized Graph Neural Network [65.20589262811677]
We develop a binarized graph neural network to learn the binary representations of the nodes with binary network parameters.
Our proposed method can be seamlessly integrated into the existing GNN-based embedding approaches.
Experiments indicate that the proposed binarized graph neural network, namely BGN, is orders of magnitude more efficient in terms of both time and space.
arXiv Detail & Related papers (2020-04-19T09:43:14Z) - Learning to Hash with Graph Neural Networks for Recommender Systems [103.82479899868191]
Graph representation learning has attracted much attention in supporting high quality candidate search at scale.
Despite its effectiveness in learning embedding vectors for objects in the user-item interaction network, the computational costs to infer users' preferences in continuous embedding space are tremendous.
We propose a simple yet effective discrete representation learning framework to jointly learn continuous and discrete codes.
arXiv Detail & Related papers (2020-03-04T06:59:56Z)
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.