Improving Matrix Completion by Exploiting Rating Ordinality in Graph Neural Networks

• URL: http://arxiv.org/abs/2403.04504v1
• Date: Thu, 7 Mar 2024 14:04:33 GMT
• Title: Improving Matrix Completion by Exploiting Rating Ordinality in Graph Neural Networks
• Authors: Jaehyun Lee, Seonku Kang, Hwanjo Yu
• Abstract summary: 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.
• Score: 15.288361490454276
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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 and predict the edges between the user and item nodes by using the graph neural network (GNN). Despite their effectiveness, they treat each rating type as an independent relation type and thus cannot sufficiently consider the ordinal nature of the ratings. In this paper, we explore a new approach to exploit rating ordinality for GNN, which has not been studied well in the literature. We introduce a new method, called ROGMC, to leverage Rating Ordinality in GNN-based Matrix Completion. It uses cumulative preference propagation to directly incorporate rating ordinality in GNN's message passing, allowing for users' stronger preferences to be more emphasized based on inherent orders of rating types. This process is complemented by interest regularization which facilitates preference learning using the underlying interest information. Our extensive experiments show that ROGMC consistently outperforms the existing strategies of using rating types for GNN. We expect that our attempt to explore the feasibility of utilizing rating ordinality for GNN may stimulate further research in this direction.

Related papers

• Linear-Time Graph Neural Networks for Scalable Recommendations [50.45612795600707]
  The key of recommender systems is to forecast users' future behaviors based on previous user-item interactions. Recent years have witnessed a rising interest in leveraging Graph Neural Networks (GNNs) to boost the prediction performance of recommender systems. We propose a Linear-Time Graph Neural Network (LTGNN) to scale up GNN-based recommender systems to achieve comparable scalability as classic MF approaches.
  arXiv  Detail & Related papers  (2024-02-21T17:58:10Z)
• Classifying Nodes in Graphs without GNNs [50.311528896010785]
  We propose a fully GNN-free approach for node classification, not requiring them at train or test time. Our method consists of three key components: smoothness constraints, pseudo-labeling iterations and neighborhood-label histograms.
  arXiv  Detail & Related papers  (2024-02-08T18:59:30Z)
• GNNEvaluator: Evaluating GNN Performance On Unseen Graphs Without Labels [81.93520935479984]
  We study a new problem, GNN model evaluation, that aims to assess the performance of a specific GNN model trained on labeled and observed graphs. We propose a two-stage GNN model evaluation framework, including (1) DiscGraph set construction and (2) GNNEvaluator training and inference. Under the effective training supervision from the DiscGraph set, GNNEvaluator learns to precisely estimate node classification accuracy of the to-be-evaluated GNN model.
  arXiv  Detail & Related papers  (2023-10-23T05:51:59Z)
• Every Node Counts: Improving the Training of Graph Neural Networks on Node Classification [9.539495585692007]
  We propose novel objective terms for the training of GNNs for node classification. Our first term seeks to maximize the mutual information between node and label features. Our second term promotes anisotropic smoothness in the prediction maps.
  arXiv  Detail & Related papers  (2022-11-29T23:25:14Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• GNNRank: Learning Global Rankings from Pairwise Comparisons via Directed Graph Neural Networks [68.61934077627085]
  We introduce GNNRank, a modeling framework compatible with any GNN capable of learning digraph embeddings. We show that our methods attain competitive and often superior performance compared with existing approaches.
  arXiv  Detail & Related papers  (2022-02-01T04:19:50Z)
• Attention-Based Recommendation On Graphs [9.558392439655012]
  Graph Neural Networks (GNN) have shown remarkable performance in different tasks. In this study, we propose GARec as a model-based recommender system. The presented method outperforms existing model-based, non-graph neural networks and graph neural networks in different MovieLens datasets.
  arXiv  Detail & Related papers  (2022-01-04T21:02:02Z)
• SiReN: Sign-Aware Recommendation Using Graph Neural Networks [6.739000442575012]
  We present SiReN, a new sign-aware recommender system based on GNN models. SiReN consistently outperforms state-of-the-art NE-aided recommendation methods.
  arXiv  Detail & Related papers  (2021-08-19T15:07:06Z)
• 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)
• Ranking Structured Objects with Graph Neural Networks [0.0]
  RankGNNs are trained with a set of pair-wise preferences between graphs, suggesting that one of them is preferred over the other. One practical application of this problem is drug screening, where an expert wants to find the most promising molecules in a large collection of drug candidates. We empirically demonstrate that our proposed pair-wise RankGNN approach either significantly outperforms or at least matches the ranking performance of the naive point-wise baseline approach.
  arXiv  Detail & Related papers  (2021-04-18T14:40:59Z)
• Higher-Order Attribute-Enhancing Heterogeneous Graph Neural Networks [67.25782890241496]
  We propose a higher-order Attribute-Enhancing Graph Neural Network (HAEGNN) for heterogeneous network representation learning. HAEGNN simultaneously incorporates meta-paths and meta-graphs for rich, heterogeneous semantics. It shows superior performance against the state-of-the-art methods in node classification, node clustering, and visualization.
  arXiv  Detail & Related papers  (2021-04-16T04:56:38Z)

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.