DFGNN: Dual-frequency Graph Neural Network for Sign-aware Feedback
Not on the map. Why?
Abstract (arXiv)
The graph-based recommendation has achieved great success in recent years. However, most existing graph-based recommendations focus on capturing user preference based on positive edges/feedback, while ignoring negative edges/feedback (e.g., dislike, low rating) that widely exist in real-world recommender systems. How to utilize negative feedback in graph-based recommendations still remains underexplored. In this study, we first conducted a comprehensive experimental analysis and found that (1) existing graph neural networks are not well-suited for modeling negative feedback, which acts as a high-frequency signal in a user-item graph. (2) The graph-based recommendation suffers from the representation degeneration problem. Based on the two observations, we propose a novel model that models positive and negative feedback from a frequency filter perspective called Dual-frequency Graph Neural Network for Sign-aware Recommendation (DFGNN). Specifically, in DFGNN, the designed dual-frequency graph filter (DGF) captures both low-frequency and high-frequency signals that contain positive and negative feedback. Furthermore, the proposed signed graph regularization is applied to maintain the user/item embedding uniform in the embedding space to alleviate the representation degeneration problem. Additionally, we conduct extensive experiments on real-world datasets and demonstrate the effectiveness of the proposed model. Codes of our model will be released upon acceptance.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 28 of its 46 references that are in the map. First posted on arXiv 24 May 2024.
Builds on
28 of 46 references.
References · 28
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2017Graph Attention Networkscited by 8,854
- 2017Inductive Representation Learning on Large Graphscited by 6,284
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
- 2019Simplifying Graph Convolutional Networkscited by 1,470
- 2018Self-Attentive Sequential Recommendationcited by 1,169
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2017Neural Collaborative Filteringcited by 1,108
- 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,097
16 more
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
- 2019Graph U-Netscited by 489
- 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
- 2020A Note on Over-Smoothing for Graph Neural Networkscited by 245
- 2022Pre-training Enhanced Spatial-temporal Graph Neural Network for Multivariate Time Series Forecastingcited by 117
- 2019Signed Graph Attention Networkscited by 62
- 2021A Survey of Machine Learning for Computer Architecture and Systemscited by 53
- 2022Self-supervised Hypergraph Representation Learning for Sociological Analysiscited by 27
- 2023A Survey on Causal Inference for Recommendationcited by 22
- 2022Multi-view Multi-behavior Contrastive Learning in Recommendationcited by 21
- 2021Signed Bipartite Graph Neural Networkscited by 18
- 2020Signed Graph Diffusion Networkcited by 13
- 2022LaT: Latent Translation with Cycle-Consistency for Video-Text Retrievalcited by 9
- 2022Addressing Over-Smoothing in Graph Neural Networks via Deep Supervisioncited by 7
- 2023Modeling Dual Period-Varying Preferences for Takeaway Recommendationcited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.