Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Towards Unified Modeling for Positive and Negative Preferences in Sign-Aware Recommendation (2403.08246v1)

Published 13 Mar 2024 in cs.IR, cs.LG, and cs.SI

Abstract: 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 \textbf{L}ight \textbf{S}igned \textbf{G}raph Convolution Network specifically for \textbf{Rec}ommendation (\textbf{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 \url{https://anonymous.4open.science/r/LSGRec-BB95}.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (45)
  1. Structure information learning for neutral links in signed network embedding. Information Processing & Management (2022), 102917.
  2. Dorwin Cartwright and Frank Harary. 1977. STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER’S THEORY1. In Psychological Review. 277.
  3. Graph Heterogeneous Multi-Relational Recommendation. In AAAI Conference on Artificial Intelligence. 3958–3966.
  4. Revisiting graph based collaborative filtering: A linear residual graph convolutional network approach. In AAAI Conference on Artificial Intelligence. 27–34.
  5. ”Bridge”: Enhanced Signed Directed Network Embedding. Proceedings of the 27th ACM International Conference on Information and Knowledge Management (2018), 773–782.
  6. Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering. In Advances in Neural Information Processing Systems 34. 1–9.
  7. Signed Graph Convolutional Networks. In 2018 IEEE International Conference on Data Mining (ICDM). 929–934.
  8. Graph Neural Networks for Social Recommendation. In The World Wide Web Conference. 417–426.
  9. Graph neural networks for social recommendation. In The World Wide Web Conference. 417–426.
  10. The graph neural network model. IEEE Transactions on neural networks (2008), 61–80.
  11. Xavier Glorot and Yoshua Bengio. 2010. Understanding the difficulty of training deep feedforward neural networks. In Artificial Intelligence and Statistics. 1–8.
  12. Marco Gori and Augusto Pucci. 2007. ItemRank: A Random-Walk Based Scoring Algorithm for Recommender Engines. In International Joint Conference on Artificial Intelligence. 2766–2771.
  13. Inductive Representation Learning on Large Graphs. In Neural Information Processing Systems. 1025–1035.
  14. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 639–648.
  15. Signed Bipartite Graph Neural Networks. Proceedings of the 30th ACM International Conference on Information & Knowledge Management (2021), 740–749.
  16. SDGNN: Learning Node Representation for Signed Directed Networks. In AAAI Conference on Artificial Intelligence. 196–203.
  17. Negative Can Be Positive: Signed Graph Neural Networks for Recommendation. Information Processing & Management (2023), 103403–103417.
  18. Signed Graph Attention Networks. In Artificial Neural Networks and Machine Learning – ICANN 2019: Workshop and Special Sessions. 566–577.
  19. Dual-LightGCN: Dual light graph convolutional network for discriminative recommendation. Comput. Commun. (2023), 89–100.
  20. SIGNet: Scalable Embeddings for Signed Networks. In Pacific-Asia Conference on Knowledge Discovery and Data Mining. 42–54.
  21. Olivier Jeunen. 2019. Revisiting offline evaluation for implicit-feedback recommender systems. In Proceedings of the 13th ACM Conference on Recommender Systems. 596–600.
  22. Diederik P. Kingma and Jimmy Ba. 2015. Adam: A Method for Stochastic Optimization. CoRR (2015).
  23. Thomas Kipf and Max Welling. 2016. Semi-Supervised Classification with Graph Convolutional Networks. ArXiv (2016), 1–14.
  24. Graph Transformer for Recommendation. In Proceedings of the 46th International ACM SIGIR. 1680–1689.
  25. Learning Signed Network Embedding via Graph Attention. In AAAI Conference on Artificial Intelligence. 4772–4779.
  26. Signed Graph Neural Network with Latent Groups. Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining (2021), 1066–1075.
  27. ID Embedding as Subtle Features of Content and Structure for Multimodal Recommendation. ArXiv (2023), 1–11.
  28. PANE-GNN: Unifying Positive and Negative Edges in Graph Neural Networks for Recommendation. arXiv preprint arXiv:2306.04095 (2023).
  29. UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendation. In Proceedings of the 30th ACM International Conference on Information & Knowledge Management. 1253–1262.
  30. Self-Supervised Graph Transformer on Large-Scale Molecular Data. In Advances in Neural Information Processing Systems. 12559–12571.
  31. SiReN: Sign-Aware Recommendation Using Graph Neural Networks. IEEE Transactions on Neural Networks and Learning Systems (2022), 1–15.
  32. SGCL: Contrastive Representation Learning for Signed Graphs. Proceedings of the 30th ACM International Conference on Information & Knowledge Management (2021), 1671–1680.
  33. Graph Attention Networks. ArXiv (2017), 1–12.
  34. Signed Network Embedding in Social Media. In Proceedings of the 2017 SIAM International Conference on Data Mining. 327–335.
  35. Neural Graph Collaborative Filtering. In Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval. 165–174.
  36. Learning from Negative User Feedback and Measuring Responsiveness for Sequential Recommenders. In Proceedings of the 17th ACM Conference on Recommender Systems. 1049–1053.
  37. MMGCN: Multi-modal Graph Convolution Network for Personalized Recommendation of Micro-video. In Proceedings of the 27th ACM International Conference on Multimedia. 1437–1445.
  38. Simplifying Graph Convolutional Networks. In International Conference on Machine Learning. 6861–6871.
  39. Self-supervised graph learning for recommendation. In Proceedings of the 44th international ACM SIGIR conference on research and development in information retrieval. 726–735.
  40. Graph neural networks in recommender systems: a survey. Comput. Surveys (2022), 1–37.
  41. Signed Network Representation by Preserving Multi-Order Signed Proximity. IEEE Transactions on Knowledge and Data Engineering (2023), 3087–3100.
  42. Dual-branch Density Ratio Estimation for Signed Network Embedding. In Proceedings of the ACM Web Conference 2022. 1651–1662.
  43. Enhancing Social Recommendation With Adversarial Graph Convolutional Networks. IEEE Transactions on Knowledge and Data Engineering (2020), 3727–3739.
  44. Mining Latent Structures for Multimedia Recommendation. In Proceedings of the 29th ACM International Conference on Multimedia. 3872–3880.
  45. Contrastive Learning for Signed Bipartite Graphs. In Proceedings of the 46th International ACM SIGIR Conference on Research and Development in Information Retrieval. 1629–1638.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Yuting Liu (62 papers)
  2. Yizhou Dang (9 papers)
  3. Yuliang Liang (9 papers)
  4. Qiang Liu (405 papers)
  5. Guibing Guo (35 papers)
  6. Jianzhe Zhao (14 papers)
  7. Xingwei Wang (35 papers)

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets