Learning Social Graph for Inactive User Recommendation

• URL: http://arxiv.org/abs/2405.05288v3
• Date: Wed, 22 May 2024 05:54:17 GMT
• Title: Learning Social Graph for Inactive User Recommendation
• Authors: Nian Liu, Shen Fan, Ting Bai, Peng Wang, Mingwei Sun, Yanhu Mo, Xiaoxiao Xu, Hong Liu, Chuan Shi,
• Abstract summary: 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.
• Score: 50.090904659803854
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Social relations have been widely incorporated into recommender systems to alleviate data sparsity problem. However, raw social relations don't always benefit recommendation due to their inferior quality and insufficient quantity, especially for inactive users, whose interacted items are limited. In this paper, we propose a novel social recommendation method called LSIR (\textbf{L}earning \textbf{S}ocial Graph for \textbf{I}nactive User \textbf{R}ecommendation) that learns an optimal social graph structure for social recommendation, especially for inactive users. LSIR recursively aggregates user and item embeddings to collaboratively encode item and user features. Then, graph structure learning (GSL) is employed to refine the raw user-user social graph, by removing noisy edges and adding new edges based on the enhanced embeddings. Meanwhile, mimic learning is implemented to guide active users in mimicking inactive users during model training, which improves the construction of new edges for inactive users. Extensive experiments on real-world datasets demonstrate that LSIR achieves significant improvements of up to 129.58\% on NDCG in inactive user recommendation. Our code is available at~\url{https://github.com/liun-online/LSIR}.

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)
• Representation Learning with Large Language Models for Recommendation [34.46344639742642]
  We propose a model-agnostic framework RLMRec to enhance recommenders with large language models (LLMs)empowered representation learning. RLMRec incorporates auxiliary textual signals, develops a user/item profiling paradigm empowered by LLMs, and aligns the semantic space of LLMs with the representation space of collaborative relational signals.
  arXiv  Detail & Related papers  (2023-10-24T15:51:13Z)
• Dual Intent Enhanced Graph Neural Network for Session-based New Item Recommendation [74.81561396321712]
  We propose a dual-intent enhanced graph neural network for session-based recommendations. We learn user intent from an attention mechanism and the distribution of historical data. By outputting new item probabilities, which contain recommendation scores of the corresponding items, the new items with higher scores are recommended to users.
  arXiv  Detail & Related papers  (2023-05-10T02:42:12Z)
• Graph Collaborative Signals Denoising and Augmentation for Recommendation [75.25320844036574]
  We propose a new graph adjacency matrix that incorporates user-user and item-item correlations. We show that the inclusion of user-user and item-item correlations can improve recommendations for users with both abundant and insufficient interactions.
  arXiv  Detail & Related papers  (2023-04-06T19:43:37Z)
• FedGRec: Federated Graph Recommender System with Lazy Update of Latent Embeddings [108.77460689459247]
  We propose a Federated Graph Recommender System (FedGRec) to mitigate privacy concerns. In our system, users and the server explicitly store latent embeddings for users and items, where the latent embeddings summarize different orders of indirect user-item interactions. We perform extensive empirical evaluations to verify the efficacy of using latent embeddings as a proxy of missing interaction graph.
  arXiv  Detail & Related papers  (2022-10-25T01:08:20Z)
• 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)
• Learning to Learn a Cold-start Sequential Recommender [70.5692886883067]
  The cold-start recommendation is an urgent problem in contemporary online applications. We propose a meta-learning based cold-start sequential recommendation framework called metaCSR. metaCSR holds the ability to learn the common patterns from regular users' behaviors.
  arXiv  Detail & Related papers  (2021-10-18T08:11:24Z)
• Knowledge-aware Coupled Graph Neural Network for Social Recommendation [29.648300580880683]
  We propose a Knowledge-aware Coupled Graph Neural Network (KCGN) that injects the inter-dependent knowledge across items and users into the recommendation framework. KCGN enables the high-order user- and item-wise relation encoding by exploiting the mutual information for global graph structure awareness. We further augment KCGN with the capability of capturing dynamic multi-typed user-item interactive patterns.
  arXiv  Detail & Related papers  (2021-10-08T09:13:51Z)

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.