Propagation-aware Social Recommendation by Transfer Learning
- URL: http://arxiv.org/abs/2107.04846v1
- Date: Sat, 10 Jul 2021 14:21:27 GMT
- Title: Propagation-aware Social Recommendation by Transfer Learning
- Authors: Haodong Chang and Yabo Chu
- Abstract summary: We propose a novel Transfer Learning Network based on the propagation of social relations.
We explore social influence in two aspects: (a) higher-order friends have been taken into consideration by order bias; (b) different friends in the same order will have distinct importance for recommendation by an attention mechanism.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Social-aware recommendation approaches have been recognized as an effective
way to solve the data sparsity issue of traditional recommender systems. The
assumption behind is that the knowledge in social user-user connections can be
shared and transferred to the domain of user-item interactions, whereby to help
learn user preferences. However, most existing approaches merely adopt the
first-order connections among users during transfer learning, ignoring those
connections in higher orders. We argue that better recommendation performance
can also benefit from high-order social relations. In this paper, we propose a
novel Propagation-aware Transfer Learning Network (PTLN) based on the
propagation of social relations. We aim to better mine the sharing knowledge
hidden in social networks and thus further improve recommendation performance.
Specifically, we explore social influence in two aspects: (a) higher-order
friends have been taken into consideration by order bias; (b) different friends
in the same order will have distinct importance for recommendation by an
attention mechanism. Besides, we design a novel regularization to bridge the
gap between social relations and user-item interactions. We conduct extensive
experiments on two real-world datasets and beat other counterparts in terms of
ranking accuracy, especially for the cold-start users with few historical
interactions.
Related papers
- Incorporating Like-Minded Peers to Overcome Friend Data Sparsity in Session-Based Social Recommendations [27.10643133940311]
This paper introduces the concept of "Like-minded Peers" (LMP)
LMP represents users whose preferences align with the target user's current session based on their historical sessions.
This approach not only alleviates the problem of friend data sparsity but also effectively incorporates users with similar preferences to the target user.
arXiv Detail & Related papers (2024-09-04T13:39:12Z) - Balancing User Preferences by Social Networks: A Condition-Guided Social Recommendation Model for Mitigating Popularity Bias [64.73474454254105]
Social recommendation models weave social interactions into their design to provide uniquely personalized recommendation results for users.
Existing social recommendation models fail to address the issues of popularity bias and the redundancy of social information.
We propose a Condition-Guided Social Recommendation Model (named CGSoRec) to mitigate the model's popularity bias.
arXiv Detail & Related papers (2024-05-27T02:45:01Z) - Learning Social Graph for Inactive User Recommendation [50.090904659803854]
LSIR learns an optimal social graph structure for social recommendation, especially for inactive users.
Experiments on real-world datasets demonstrate that LSIR achieves significant improvements of up to 129.58% on NDCG in inactive user recommendation.
arXiv Detail & Related papers (2024-05-08T03:40:36Z) - IDVT: Interest-aware Denoising and View-guided Tuning for Social Recommendation [25.499653256726926]
Socially connected users are assumed to share similar preferences, enhancing recommendation accuracy and addressing cold start issues.
Our statistical analysis indicates a significant amount of noise in the social network, where many socially connected users do not share common interests.
We propose an innovative underlineInterest-aware underlineDenoising and underlineView-guided underlineTuning (IDVT) method for the social recommendation.
arXiv Detail & Related papers (2023-08-30T10:03:55Z) - Cross-Network Social User Embedding with Hybrid Differential Privacy
Guarantees [81.6471440778355]
We propose a Cross-network Social User Embedding framework, namely DP-CroSUE, to learn the comprehensive representations of users in a privacy-preserving way.
In particular, for each heterogeneous social network, we first introduce a hybrid differential privacy notion to capture the variation of privacy expectations for heterogeneous data types.
To further enhance user embeddings, a novel cross-network GCN embedding model is designed to transfer knowledge across networks through those aligned users.
arXiv Detail & Related papers (2022-09-04T06:22:37Z) - Disentangled Contrastive Learning for Social Recommendation [28.606016662435117]
Social recommendations utilize social relations to enhance the representation learning for recommendations.
We propose a novel Disentangled contrastive learning framework for social Recommendations DcRec.
arXiv Detail & Related papers (2022-08-18T09:15:18Z) - Federated Social Recommendation with Graph Neural Network [69.36135187771929]
We propose fusing social information with user-item interactions to alleviate it, which is the social recommendation problem.
We devise a novel framework textbfFedrated textbfSocial recommendation with textbfGraph neural network (FeSoG)
arXiv Detail & Related papers (2021-11-21T09:41:39Z) - Harnessing the Power of Ego Network Layers for Link Prediction in Online
Social Networks [0.734084539365505]
Predictions are typically based on unsupervised or supervised learning.
We argue that richer information about personal social structure of individuals might lead to better predictions.
We show that social-awareness generally provides significant improvements in the prediction performance.
arXiv Detail & Related papers (2021-09-19T18:49:10Z) - Dual Side Deep Context-aware Modulation for Social Recommendation [50.59008227281762]
We propose a novel graph neural network to model the social relation and collaborative relation.
On top of high-order relations, a dual side deep context-aware modulation is introduced to capture the friends' information and item attraction.
arXiv Detail & Related papers (2021-03-16T11:08:30Z) - DiffNet++: A Neural Influence and Interest Diffusion Network for Social
Recommendation [50.08581302050378]
Social recommendation has emerged to leverage social connections among users for predicting users' unknown preferences.
We propose a preliminary work of a neural influence diffusion network (i.e., DiffNet) for social recommendation (Diffnet)
In this paper, we propose DiffNet++, an improved algorithm of Diffnet that models the neural influence diffusion and interest diffusion in a unified framework.
arXiv Detail & Related papers (2020-01-15T08:45:34Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.