mlsanityData to 7 Oct 2026

Towards Unified Modeling for Positive and Negative Preferences in Sign-Aware Recommendation

arXiv 2403.08246 ↗First posted 13 Mar 2024cs.IR cs.LG cs.SIcited by 1

Not on the map. Why?

Abstract (arXiv)

Recently, sign-aware graph recommendation has drawn much attention as it will learn users' negative preferences besides positive ones from both positive and negative interactions (i.e., links in a graph) with items. To accommodate the different semantics of negative and positive links, existing works utilize two independent encoders to model users' positive and negative preferences, respectively. However, these approaches cannot learn the negative preferences from high-order heterogeneous interactions between users and items formed by multiple links with different signs, resulting in inaccurate and incomplete negative user preferences. To cope with these intractable issues, we propose a novel Light Signed Graph Convolution Network specifically for Recommendation (LSGRec), which adopts a unified modeling approach to simultaneously model high-order users' positive and negative preferences on a signed user-item interaction graph. Specifically, for the negative preferences within high-order heterogeneous interactions, first-order negative preferences are captured by the negative links, while high-order negative preferences are propagated along positive edges. Then, recommendation results are generated based on positive preferences and optimized with negative ones. Finally, we train representations of users and items through different auxiliary tasks. Extensive experiments on three real-world datasets demonstrate that our method outperforms existing baselines regarding performance and computational efficiency. Our code is available at urlhttps://anonymous.4open.science/r/LSGRec-BB95.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 42 references that are in the map. First posted on arXiv 13 Mar 2024.

Builds on

18 of 42 references.

References · 18

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
  3. 2017Graph Attention Networkscited by 8,854
  4. 2017Inductive Representation Learning on Large Graphscited by 6,284
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,085
  6. 2019Simplifying Graph Convolutional Networkscited by 1,470
  7. 2019Graph Neural Networks for Social Recommendationcited by 711
  8. 2019Neural Graph Collaborative Filteringcited by 660
  9. 2020Graph Neural Networks in Recommender Systems: A Surveycited by 493
  10. 2020Self-supervised Graph Learning for Recommendationcited by 305
  11. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
  12. 2021Mining Latent Structures for Multimedia Recommendationcited by 79
6 more
  1. 2021SDGNN: Learning Node Representation for Signed Directed Networkscited by 44
  2. 2021Signed Bipartite Graph Neural Networkscited by 18
  3. 2017Distributed Representations of Signed Networkscited by 17
  4. 2023Learning from Negative User Feedback and Measuring Responsiveness for Sequential Recommenderscited by 7
  5. 2023PANE-GNN: Unifying Positive and Negative Edges in Graph Neural Networks for Recommendationcited by 4
  6. 2023ID Embedding as Subtle Features of Content and Structure for Multimodal Recommendationcited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.