Embedding Ranking-Oriented Recommender System Graphs

• URL: http://arxiv.org/abs/2007.16173v1
• Date: Fri, 31 Jul 2020 16:56:54 GMT
• Title: Embedding Ranking-Oriented Recommender System Graphs
• Authors: Taher Hekmatfar, Saman Haratizadeh, Sama Goliaei
• Abstract summary: 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.
• Score: 10.74267520911262
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph-based recommender systems (GRSs) analyze the structural information in the graphical representation of data to make better recommendations, especially when the direct user-item relation data is sparse. Ranking-oriented GRSs that form a major class of recommendation systems, mostly use the graphical representation of preference (or rank) data for measuring node similarities, from which they can infer a recommendation list using a neighborhood-based mechanism. In this paper, we propose PGRec, a novel graph-based ranking-oriented recommendation framework. PGRec models the preferences of the users over items, by a novel graph structure called PrefGraph. This graph is then exploited by an improved embedding approach, taking advantage of both factorization and deep learning methods, to extract vectors representing users, items, and preferences. The resulting embedding are then used for predicting users' unknown pairwise preferences from which the final recommendation lists are inferred. 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.

Related papers

• Preference and Concurrence Aware Bayesian Graph Neural Networks for Recommender Systems [5.465420718331109]
  Graph-based collaborative filtering methods have prevailing performance for recommender systems. We propose an efficient generative model that jointly considers the preferences of users, the concurrence of items and some important graph structure information.
  arXiv  Detail & Related papers  (2023-11-30T11:49:33Z)
• Neural Graph Collaborative Filtering Using Variational Inference [19.80976833118502]
  We introduce variational embedding collaborative filtering (GVECF) as a novel framework to incorporate representations learned through a variational graph auto-encoder. Our proposed method achieves up to 13.78% improvement in the recall over the test data.
  arXiv  Detail & Related papers  (2023-11-20T15:01:33Z)
• Challenging the Myth of Graph Collaborative Filtering: a Reasoned and Reproducibility-driven Analysis [50.972595036856035]
  We present a code that successfully replicates results from six popular and recent graph recommendation models. We compare these graph models with traditional collaborative filtering models that historically performed well in offline evaluations. By investigating the information flow from users' neighborhoods, we aim to identify which models are influenced by intrinsic features in the dataset structure.
  arXiv  Detail & Related papers  (2023-08-01T09:31:44Z)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• 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)
• Recommender systems based on graph embedding techniques: A comprehensive review [9.871096870138043]
  This article systematically retrospects graph embedding-based recommendation from embedding techniques for bipartite graphs, general graphs, and knowledge graphs. Comparing several representative graph embedding-based recommendation models with the most common-used conventional recommendation models, on simulations, manifests that the conventional models overall outperform the graph embedding-based ones in predicting implicit user-item interactions.
  arXiv  Detail & Related papers  (2021-09-20T14:42:39Z)
• 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)
• 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)
• Graph Learning based Recommender Systems: A Review [111.43249652335555]
  Graph Learning based Recommender Systems (GLRS) employ advanced graph learning approaches to model users' preferences and intentions as well as items' characteristics for recommendations. We provide a systematic review of GLRS, by discussing how they extract important knowledge from graph-based representations to improve the accuracy, reliability and explainability of the recommendations.
  arXiv  Detail & Related papers  (2021-05-13T14:50:45Z)
• Auto-weighted Multi-view Feature Selection with Graph Optimization [90.26124046530319]
  We propose a novel unsupervised multi-view feature selection model based on graph learning. The contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-11T03:25:25Z)
• Graph Convolution Machine for Context-aware Recommender System [59.50474932860843]
  We extend the advantages of graph convolutions to context-aware recommender system (CARS) We propose textitGraph Convolution Machine (GCM), an end-to-end framework that consists of three components: an encoder, graph convolution layers, and a decoder. We conduct experiments on three real-world datasets from Yelp and Amazon, validating the effectiveness of GCM and the benefits of performing graph convolutions for CARS.
  arXiv  Detail & Related papers  (2020-01-30T15:32:08Z)

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.