analiza aiqbench
GSPRec addresses a specific limitation in graph-based collaborative filtering by incorporating item-item proximity derived from user interaction sequences to recover discarded intermediate-frequency community preferences. This approach yields richer spectral representations that outperform existing baselines across multiple datasets, demonstrating the critical coupling between graph construction and filter design for recommendation accuracy. The work represents a significant methodological advance within machine learning research focused on improving collaborative filtering models through advanced signal processing techniques.
GSPRec: On Improving Item Representations in Graph Signal Processing for Collaborative Filtering
arXiv:2505.11552v3 Announce Type: replace-cross Abstract: 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.
Abstract: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.
Information Retrieval (cs.IR); Artificial Intelligence (cs.AI)
arXiv:2505.11552 [cs.IR]
(or arXiv:2505.11552v3 [cs.IR] for this version)
Text integral sub licența deschisă a publicației · 202 cuvinte
Subiecte conexe

News
Quantum Computing Report · 25 iul. 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · 18 sept. 2026
J++ Lens: Jacobian Filtering Enables More Faithful Workspace Lenses
LessWrong · 8 oct. 2026
An Analysis of Role Semantics in Directed Dynamic Graph Modeling for Edge Classification
arXiv · 15 oct. 2026