Adaptive spectral graph wavelets for collaborative filtering

• URL: http://arxiv.org/abs/2312.03167v1
• Date: Tue, 5 Dec 2023 22:22:25 GMT
• Title: Adaptive spectral graph wavelets for collaborative filtering
• Authors: Osama Alshareet and A. Ben Hamza
• Abstract summary: Collaborative filtering is a popular approach in recommender systems, whose objective is to provide personalized item suggestions. We introduce a spectral graph wavelet collaborative filtering framework for implicit feedback data, where users, items and their interactions are represented as a bipartite graph. In addition to capturing the graph's local and global structures, our approach yields localization of graph signals in both spatial and spectral domains.
• Score: 5.547800834335382
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Collaborative filtering is a popular approach in recommender systems, whose objective is to provide personalized item suggestions to potential users based on their purchase or browsing history. However, personalized recommendations require considerable amount of behavioral data on users, which is usually unavailable for new users, giving rise to the cold-start problem. To help alleviate this challenging problem, we introduce a spectral graph wavelet collaborative filtering framework for implicit feedback data, where users, items and their interactions are represented as a bipartite graph. Specifically, we first propose an adaptive transfer function by leveraging a power transform with the goal of stabilizing the variance of graph frequencies in the spectral domain. Then, we design a deep recommendation model for efficient learning of low-dimensional embeddings of users and items using spectral graph wavelets in an end-to-end fashion. In addition to capturing the graph's local and global structures, our approach yields localization of graph signals in both spatial and spectral domains, and hence not only learns discriminative representations of users and items, but also promotes the recommendation quality. The effectiveness of our proposed model is demonstrated through extensive experiments on real-world benchmark datasets, achieving better recommendation performance compared with strong baseline methods.

Related papers

• GPT4Rec: Graph Prompt Tuning for Streaming Recommendation [30.604441550735494]
  We present GPT4Rec, a Graph Prompt Tuning method for streaming Recommendation. In particular, GPT4Rec disentangles the graph patterns into multiple views. It guides the model across varying interaction patterns within the user-item graph.
  arXiv  Detail & Related papers  (2024-06-12T13:59:31Z)
• 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)
• Frequency-aware Graph Signal Processing for Collaborative Filtering [26.317108637430664]
  We propose a frequency-aware graph signal processing method (FaGSP) for collaborative filtering. Firstly, we design a Cascaded Filter Module, consisting of an ideal high-pass filter and an ideal low-pass filter. Then, we devise a Parallel Filter Module, consisting of two low-pass filters that can easily capture the hierarchy of neighborhood.
  arXiv  Detail & Related papers  (2024-02-13T12:53:18Z)
• 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)
• APGL4SR: A Generic Framework with Adaptive and Personalized Global Collaborative Information in Sequential Recommendation [86.29366168836141]
  We propose a graph-driven framework, named Adaptive and Personalized Graph Learning for Sequential Recommendation (APGL4SR) APGL4SR incorporates adaptive and personalized global collaborative information into sequential recommendation systems. As a generic framework, APGL4SR can outperform other baselines with significant margins.
  arXiv  Detail & Related papers  (2023-11-06T01:33:24Z)
• Bayes-enhanced Multi-view Attention Networks for Robust POI Recommendation [81.4999547454189]
  Existing works assume the available POI check-ins reported by users are the ground-truth depiction of user behaviors. In real application scenarios, the check-in data can be rather unreliable due to both subjective and objective causes. We propose a Bayes-enhanced Multi-view Attention Network to address the uncertainty factors of the user check-ins.
  arXiv  Detail & Related papers  (2023-11-01T12:47:38Z)
• 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)
• 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)

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.