Criteria Tell You More than Ratings: Criteria Preference-Aware Light Graph Convolution for Effective Multi-Criteria Recommendation

• URL: http://arxiv.org/abs/2305.18885v4
• Date: Tue, 6 Jun 2023 15:45:30 GMT
• Title: Criteria Tell You More than Ratings: Criteria Preference-Aware Light Graph Convolution for Effective Multi-Criteria Recommendation
• Authors: Jin-Duk Park, Siqing Li, Xin Cao, Won-Yong Shin
• Abstract summary: We make the first attempt towards designing a GNN-aided MC recommender system. Specifically, we devise a novel criteria preference-aware light graph convolution CPA-LGC method. To this end, we first construct an MC expansion graph that transforms user--item MC ratings into an expanded bipartite graph. Next, to strengthen the capability of criteria preference awareness, CPA-LGC incorporates newly characterized embeddings.
• Score: 5.536402965666082
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The multi-criteria (MC) recommender system, which leverages MC rating information in a wide range of e-commerce areas, is ubiquitous nowadays. Surprisingly, although graph neural networks (GNNs) have been widely applied to develop various recommender systems due to GNN's high expressive capability in learning graph representations, it has been still unexplored how to design MC recommender systems with GNNs. In light of this, we make the first attempt towards designing a GNN-aided MC recommender system. Specifically, rather than straightforwardly adopting existing GNN-based recommendation methods, we devise a novel criteria preference-aware light graph convolution CPA-LGC method, which is capable of precisely capturing the criteria preference of users as well as the collaborative signal in complex high-order connectivities. To this end, we first construct an MC expansion graph that transforms user--item MC ratings into an expanded bipartite graph to potentially learn from the collaborative signal in MC ratings. Next, to strengthen the capability of criteria preference awareness, CPA-LGC incorporates newly characterized embeddings, including user-specific criteria-preference embeddings and item-specific criterion embeddings, into our graph convolution model. Through comprehensive evaluations using four real-world datasets, we demonstrate (a) the superiority over benchmark MC recommendation methods and benchmark recommendation methods using GNNs with tremendous gains, (b) the effectiveness of core components in CPA-LGC, and (c) the computational efficiency.

Related papers

• Cluster-based Graph Collaborative Filtering [55.929052969825825]
  Graph Convolution Networks (GCNs) have succeeded in learning user and item representations for recommendation systems. Most existing GCN-based methods overlook the multiple interests of users while performing high-order graph convolution. We propose a novel GCN-based recommendation model, termed Cluster-based Graph Collaborative Filtering (ClusterGCF)
  arXiv  Detail & Related papers  (2024-04-16T07:05:16Z)
• Aligning GPTRec with Beyond-Accuracy Goals with Reinforcement Learning [67.71952251641545]
  GPTRec is an alternative to the Top-K model for item-by-item recommendations. We show that GPTRec offers a better tradeoff between accuracy and secondary metrics than classic greedy re-ranking techniques. Our experiments on two datasets show that GPTRec's Next-K generation approach offers a better tradeoff between accuracy and secondary metrics than classic greedy re-ranking techniques.
  arXiv  Detail & Related papers  (2024-03-07T19:47:48Z)
• 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)
• Graph Neural Bandits [49.85090929163639]
  We propose a framework named Graph Neural Bandits (GNB) to leverage the collaborative nature among users empowered by graph neural networks (GNNs) To refine the recommendation strategy, we utilize separate GNN-based models on estimated user graphs for exploitation and adaptive exploration.
  arXiv  Detail & Related papers  (2023-08-21T15:57:57Z)
• 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)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• KQGC: Knowledge Graph Embedding with Smoothing Effects of Graph Convolutions for Recommendation [3.264007084815591]
  We propose a new model for recommender systems named Knowledge Query-based Graph Convolution (KQGC) KQGC focuses on the smoothing, and leverages a simple linear graph convolution for smoothing KGE. We apply the proposed KQGC to a recommendation task that aims prospective users for specific products.
  arXiv  Detail & Related papers  (2022-05-23T09:34:06Z)
• DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN [59.160401038969795]
  We propose differentiable sampling on Knowledge Graph for Recommendation with GNN (DSKReG) We devise a differentiable sampling strategy, which enables the selection of relevant items to be jointly optimized with the model training procedure. The experimental results demonstrate that our model outperforms state-of-the-art KG-based recommender systems.
  arXiv  Detail & Related papers  (2021-08-26T16:19:59Z)
• Localized Graph Collaborative Filtering [20.868562372148677]
  We introduce a novel perspective to build GNN-based CF methods for recommendations. One key advantage of LGCF is that it does not need to learn embeddings for each user and item. Experiments on various datasets validate the effectiveness of LGCF especially in sparse scenarios.
  arXiv  Detail & Related papers  (2021-08-10T06:48:32Z)
• Knowledge-Enhanced Top-K Recommendation in Poincar\'e Ball [33.90069123451581]
  We propose a recommendation model in the hyperbolic space, which facilitates the learning of the hierarchical structure of knowledge graphs. A hyperbolic attention network is employed to determine the relative importances of neighboring entities of a certain item. We show that the proposed model outperforms the best existing models by 2-16% in terms of NDCG@K on Top-K recommendation.
  arXiv  Detail & Related papers  (2021-01-13T03:16:50Z)
• 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)

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.