mlsanityData to 14 Oct 2026

GSPRec: On Improving Item Representations in Graph Signal Processing for Collaborative Filtering

arXiv 2505.11552 ↗First posted 15 May 2025cs.IR cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph-based collaborative filtering methods act as low-pass filters in the spectral domain and discard the intermediate-frequency components where community-level user preferences reside. Existing GSP-based methods address the loss through sophisticated filter designs, yet derive item representations from the user-item interaction matrix alone. The interaction matrix captures which items each user interacted with, but not which items appear close together in users' interaction sequences. We propose GSPRec, a graph spectral collaborative filtering framework that produces richer item spectral representations by incorporating item-item proximity derived from user interaction ordering before spectral filtering. GSPRec derives item-item edges from user interaction ordering and strengthens the edges through multi-hop diffusion with exponential decay. The unified graph topology incorporates the diffused edges alongside user-item interactions. The resulting Laplacian exposes intermediate-frequency structure that a Gaussian bandpass filter selectively amplifies. A low-pass filter retains broad popularity trends. Experiments on four real-world datasets show that GSPRec outperforms all graph CF baselines, with average improvements of 5.12% in NDCG@10. Ablation studies establish that graph construction and filter design are coupled. GSPRec without the bandpass filter falls below every GSP baseline, whereas GSPRec without item-item proximity still surpasses baselines.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 35 references that are in the map. First posted on arXiv 15 May 2025.

Builds on

21 of 35 references.

References · 21

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  2. 2019Neural Graph Collaborative Filteringcited by 661
  3. 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
  4. 2019Diffusion Improves Graph Learningcited by 414
  5. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 413
  6. 2019KGAT: Knowledge Graph Attention Network for Recommendationcited by 343
  7. 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 172
  8. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  9. 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 120
  10. 2018Learning graphs from data: A signal representation perspectivecited by 119
  11. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
  12. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
9 more
  1. 2021How Powerful is Graph Convolution for Recommendation?cited by 50
  2. 2021Interest-aware Message-Passing GCN for Recommendationcited by 39
  3. 2023Personalized Graph Signal Processing for Collaborative Filteringcited by 29
  4. 2017Design of graph filters and filterbankscited by 22
  5. 2023On Manipulating Signals of User-Item Graph: A Jacobi Polynomial-based Graph Collaborative Filteringcited by 9
  6. 2024Lightweight Embeddings for Graph Collaborative Filteringcited by 5
  7. 2024Bridging Conversational and Collaborative Signals for Conversational Recommendationcited by 5
  8. 2024Frequency-aware Graph Signal Processing for Collaborative Filteringcited by 3
  9. 2018Graph Signal Processing: Filter Design and Spectral Statisticscited by 2

Built on by

Not cited yet.